Base | Representation |
---|---|
bin | 1001001101001011011011… |
… | …0011111100100100011010 |
3 | 1022211122200021121110120112 |
4 | 2103102312303330210122 |
5 | 2311314334031120442 |
6 | 33305553123124322 |
7 | 2063201562403550 |
oct | 223226663744432 |
9 | 38748607543515 |
10 | 10122010020122 |
11 | 32527a1859aa0 |
12 | 11758688136a2 |
13 | 5856698b79c0 |
14 | 26dc9d3bbbd0 |
15 | 12846b5da082 |
hex | 934b6cfc91a |
10122010020122 has 128 divisors (see below), whose sum is σ = 21203838222336. Its totient is φ = 3495960000000.
The previous prime is 10122010020121. The next prime is 10122010020127. The reversal of 10122010020122 is 22102001022101.
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 = 10122010020097 and 10122010020106.
It is not an unprimeable number, because it can be changed into a prime (10122010020121) by changing a digit.
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 63 ways as a sum of consecutive naturals, for example, 7507622 + ... + 8752622.
It is an arithmetic number, because the mean of its divisors is an integer number (165654986112).
Almost surely, 210122010020122 is an apocalyptic number.
10122010020122 is an abundant number, since it is smaller than the sum of its proper divisors (11081828202214).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10122010020122 is a wasteful number, since it uses less digits than its factorization.
10122010020122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1245196.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 10122010020122 its reverse (22102001022101), we get a palindrome (32224011042223).
The spelling of 10122010020122 in words is "ten trillion, one hundred twenty-two billion, ten million, twenty thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •