Base | Representation |
---|---|
bin | 1001001011111101001111… |
… | …0001101001101001011001 |
3 | 1022202122111112021220220120 |
4 | 2102333103301221221121 |
5 | 2310443342401333423 |
6 | 33252202310143453 |
7 | 2061526501612266 |
oct | 222772361515131 |
9 | 38678445256816 |
10 | 10101021121113 |
11 | 32449010a956a |
12 | 117178b651b89 |
13 | 5836a338b930 |
14 | 26cc6ba3826d |
15 | 127b3db31ee3 |
hex | 92fd3c69a59 |
10101021121113 has 16 divisors (see below), whose sum is σ = 14514687296256. Its totient is φ = 6211445725440.
The previous prime is 10101021121091. The next prime is 10101021121123. The reversal of 10101021121113 is 31112112010101.
It is not a de Polignac number, because 10101021121113 - 217 = 10101020990041 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10101021121092 and 10101021121101.
It is not an unprimeable number, because it can be changed into a prime (10101021121123) 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, 95097745 + ... + 95203902.
It is an arithmetic number, because the mean of its divisors is an integer number (907167956016).
Almost surely, 210101021121113 is an apocalyptic number.
10101021121113 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
10101021121113 is a deficient number, since it is larger than the sum of its proper divisors (4413666175143).
10101021121113 is a wasteful number, since it uses less digits than its factorization.
10101021121113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 190303024.
The product of its (nonzero) digits is 12, while the sum is 15.
Adding to 10101021121113 its reverse (31112112010101), we get a palindrome (41213133131214).
The spelling of 10101021121113 in words is "ten trillion, one hundred one billion, twenty-one million, one hundred twenty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.203 sec. • engine limits •