Base | Representation |
---|---|
bin | 1001001011111001011011… |
… | …1010011011001101011101 |
3 | 1022202112212100220011022020 |
4 | 2102332112322123031131 |
5 | 2310434300000323401 |
6 | 33251513112210353 |
7 | 2061462262410210 |
oct | 222762672331535 |
9 | 38675770804266 |
10 | 10100000011101 |
11 | 32444277774a0 |
12 | 11715456999b9 |
13 | 58356c970020 |
14 | 26cbb2193777 |
15 | 127ace180d36 |
hex | 92f96e9b35d |
10100000011101 has 256 divisors, whose sum is σ = 19201712259072. Its totient is φ = 4552431206400.
The previous prime is 10100000011097. The next prime is 10100000011111. The reversal of 10100000011101 is 10111000000101.
It is not a de Polignac number, because 10100000011101 - 22 = 10100000011097 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 10100000011101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10100000011111) by changing a digit.
It is a polite number, since it can be written in 255 ways as a sum of consecutive naturals, for example, 2318106615 + ... + 2318110971.
It is an arithmetic number, because the mean of its divisors is an integer number (75006688512).
Almost surely, 210100000011101 is an apocalyptic number.
10100000011101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10100000011101 is a deficient number, since it is larger than the sum of its proper divisors (9101712247971).
10100000011101 is a wasteful number, since it uses less digits than its factorization.
10100000011101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5132.
The product of its (nonzero) digits is 1, while the sum is 6.
Adding to 10100000011101 its reverse (10111000000101), we get a palindrome (20211000011202).
The spelling of 10100000011101 in words is "ten trillion, one hundred billion, eleven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •