Base | Representation |
---|---|
bin | 10110101111001101010010… |
… | …101001010000100000101011 |
3 | 111010002000100022011110012221 |
4 | 112233031102221100200223 |
5 | 101101404233141200021 |
6 | 552403513100014511 |
7 | 30030561505632361 |
oct | 2657152251204053 |
9 | 433060308143187 |
10 | 100001110100011 |
11 | 2995526169a7aa |
12 | b270a75531437 |
13 | 43a50ab121b63 |
14 | 1a9a11841d631 |
15 | b863d1e9d241 |
hex | 5af352a5082b |
100001110100011 has 8 divisors (see below), whose sum is σ = 101322253990400. Its totient is φ = 98681348886120.
The previous prime is 100001110099967. The next prime is 100001110100051. The reversal of 100001110100011 is 110001011100001.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 100001110100011 - 213 = 100001110091819 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100001110099967 and 100001110100003.
It is not an unprimeable number, because it can be changed into a prime (100001110100051) 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, 345523521 + ... + 345812818.
It is an arithmetic number, because the mean of its divisors is an integer number (12665281748800).
Almost surely, 2100001110100011 is an apocalyptic number.
100001110100011 is a deficient number, since it is larger than the sum of its proper divisors (1321143890389).
100001110100011 is an equidigital number, since it uses as much as digits as its factorization.
100001110100011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 691338249.
The product of its (nonzero) digits is 1, while the sum is 7.
Adding to 100001110100011 its reverse (110001011100001), we get a palindrome (210002121200012).
The spelling of 100001110100011 in words is "one hundred trillion, one billion, one hundred ten million, one hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •