Base | Representation |
---|---|
bin | 1001001011111101001110… |
… | …1101011101010101100001 |
3 | 1022202122111110020002100212 |
4 | 2102333103231131111201 |
5 | 2310443342111201423 |
6 | 33252202230423505 |
7 | 2061526456354226 |
oct | 222772355352541 |
9 | 38678443202325 |
10 | 10101020022113 |
11 | 32449005188a9 |
12 | 117178b201b95 |
13 | 5836a3095637 |
14 | 26cc6b82d94d |
15 | 127b3d9b6578 |
hex | 92fd3b5d561 |
10101020022113 has 8 divisors (see below), whose sum is σ = 10222778972448. Its totient is φ = 9979262498464.
The previous prime is 10101020022101. The next prime is 10101020022127. The reversal of 10101020022113 is 31122002010101.
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 10101020022113 - 224 = 10101003244897 is a prime.
It is a super-2 number, since 2×101010200221132 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10101020022173) 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, 23237381 + ... + 23668077.
It is an arithmetic number, because the mean of its divisors is an integer number (1277847371556).
Almost surely, 210101020022113 is an apocalyptic number.
It is an amenable number.
10101020022113 is a deficient number, since it is larger than the sum of its proper divisors (121758950335).
10101020022113 is an equidigital number, since it uses as much as digits as its factorization.
10101020022113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 713343.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 10101020022113 its reverse (31122002010101), we get a palindrome (41223022032214).
The spelling of 10101020022113 in words is "ten trillion, one hundred one billion, twenty million, twenty-two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •