Base | Representation |
---|---|
bin | 101110100111001110… |
… | …1010101010010000001 |
3 | 100120101011212022122012 |
4 | 1131032131111102001 |
5 | 3120001220410001 |
6 | 113552514222305 |
7 | 10142404502231 |
oct | 1351635252201 |
9 | 316334768565 |
10 | 100100560001 |
11 | 394a817a342 |
12 | 17497584995 |
13 | 95935bb0c0 |
14 | 4bb8559cc1 |
15 | 290cea02bb |
hex | 174e755481 |
100100560001 has 8 divisors (see below), whose sum is σ = 107922977064. Its totient is φ = 92295624960.
The previous prime is 100100559989. The next prime is 100100560009. The reversal of 100100560001 is 100065001001.
It can be written as a sum of positive squares in 4 ways, for example, as 5688779776 + 94411780225 = 75424^2 + 307265^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-100100560001 is a prime.
It is a super-2 number, since 2×1001005600012 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (100100560009) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4358606 + ... + 4381511.
It is an arithmetic number, because the mean of its divisors is an integer number (13490372133).
Almost surely, 2100100560001 is an apocalyptic number.
It is an amenable number.
100100560001 is a deficient number, since it is larger than the sum of its proper divisors (7822417063).
100100560001 is an equidigital number, since it uses as much as digits as its factorization.
100100560001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8741011.
The product of its (nonzero) digits is 30, while the sum is 14.
Adding to 100100560001 its reverse (100065001001), we get a palindrome (200165561002).
The spelling of 100100560001 in words is "one hundred billion, one hundred million, five hundred sixty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •