Base | Representation |
---|---|
bin | 1001000110000100111100… |
… | …0111000101010110110101 |
3 | 1022101222202222011022111001 |
4 | 2101201033013011112311 |
5 | 2302320010321401401 |
6 | 33133535223243301 |
7 | 2051322412026250 |
oct | 221411707052665 |
9 | 38358688138431 |
10 | 10000011122101 |
11 | 3205a87640240 |
12 | 115609b5a9531 |
13 | 576cc6550a50 |
14 | 2680087c6097 |
15 | 1251caddd601 |
hex | 9184f1c55b5 |
10000011122101 has 16 divisors (see below), whose sum is σ = 13426588361088. Its totient is φ = 7192815192000.
The previous prime is 10000011122039. The next prime is 10000011122113. The reversal of 10000011122101 is 10122111000001.
It is a cyclic number.
It is not a de Polignac number, because 10000011122101 - 223 = 10000002733493 is a prime.
It is a super-2 number, since 2×100000111221012 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10000011122161) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4995009550 + ... + 4995011551.
It is an arithmetic number, because the mean of its divisors is an integer number (839161772568).
Almost surely, 210000011122101 is an apocalyptic number.
10000011122101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10000011122101 is a deficient number, since it is larger than the sum of its proper divisors (3426577238987).
10000011122101 is a wasteful number, since it uses less digits than its factorization.
10000011122101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9990021132.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 10000011122101 its reverse (10122111000001), we get a palindrome (20122122122102).
The spelling of 10000011122101 in words is "ten trillion, eleven million, one hundred twenty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •