Base | Representation |
---|---|
bin | 1001001101000111101010… |
… | …1010110101110100010100 |
3 | 1022211120001221221221110202 |
4 | 2103101322222311310110 |
5 | 2311310302224001322 |
6 | 33305305040240032 |
7 | 2063134561024544 |
oct | 223217252656424 |
9 | 38746057857422 |
10 | 10121001000212 |
11 | 3252324235443 |
12 | 1175626910018 |
13 | 5855388400bb |
14 | 26dc053a3324 |
15 | 12840cc26292 |
hex | 9347aab5d14 |
10121001000212 has 24 divisors (see below), whose sum is σ = 18565693282752. Its totient is φ = 4822257988800.
The previous prime is 10121001000179. The next prime is 10121001000241. The reversal of 10121001000212 is 21200010012101.
10121001000212 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×101210010002122 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10121001000193 and 10121001000202.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 717590864 + ... + 717604967.
It is an arithmetic number, because the mean of its divisors is an integer number (773570553448).
Almost surely, 210121001000212 is an apocalyptic number.
It is an amenable number.
10121001000212 is a deficient number, since it is larger than the sum of its proper divisors (8444692282540).
10121001000212 is a wasteful number, since it uses less digits than its factorization.
10121001000212 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1435195919 (or 1435195917 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 10121001000212 its reverse (21200010012101), we get a palindrome (31321011012313).
The spelling of 10121001000212 in words is "ten trillion, one hundred twenty-one billion, one million, two hundred twelve", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •