Base | Representation |
---|---|
bin | 1001001011111101001110… |
… | …1101110101100000100010 |
3 | 1022202122111110102010011212 |
4 | 2102333103231311200202 |
5 | 2310443342122333442 |
6 | 33252202232510122 |
7 | 2061526460246000 |
oct | 222772355654042 |
9 | 38678443363155 |
10 | 10101020121122 |
11 | 3244900586227 |
12 | 117178b24b342 |
13 | 5836a30cb718 |
14 | 26cc6b857a70 |
15 | 127b3d9d5a82 |
hex | 92fd3b75822 |
10101020121122 has 64 divisors (see below), whose sum is σ = 18205068211200. Its totient is φ = 4199405833728.
The previous prime is 10101020121103. The next prime is 10101020121133. The reversal of 10101020121122 is 22112102010101.
It is a super-3 number, since 3×101010201211223 (a number of 40 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a junction number, because it is equal to n+sod(n) for n = 10101020121097 and 10101020121106.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2257118 + ... + 5029574.
It is an arithmetic number, because the mean of its divisors is an integer number (284454190800).
Almost surely, 210101020121122 is an apocalyptic number.
10101020121122 is a deficient number, since it is larger than the sum of its proper divisors (8104048090078).
10101020121122 is a wasteful number, since it uses less digits than its factorization.
10101020121122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2772640 (or 2772626 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 10101020121122 its reverse (22112102010101), we get a palindrome (32213122131223).
The spelling of 10101020121122 in words is "ten trillion, one hundred one billion, twenty million, one hundred twenty-one thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •