Base | Representation |
---|---|
bin | 1001001101001011110101… |
… | …1111001010010111011001 |
3 | 1022211122222002100020201100 |
4 | 2103102331133022113121 |
5 | 2311320101213341441 |
6 | 33310012203342013 |
7 | 2063204422333050 |
oct | 223227537122731 |
9 | 38748862306640 |
10 | 10122122012121 |
11 | 3252849aa1269 |
12 | 117589a221909 |
13 | 585686b69962 |
14 | 26dcb0211397 |
15 | 12847635ccb6 |
hex | 934bd7ca5d9 |
10122122012121 has 48 divisors (see below), whose sum is σ = 16734078167040. Its totient is φ = 5775578696160.
The previous prime is 10122122012077. The next prime is 10122122012159. The reversal of 10122122012121 is 12121022122101.
10122122012121 is a `hidden beast` number, since 10 + 1 + 221 + 220 + 1 + 212 + 1 = 666.
It is not a de Polignac number, because 10122122012121 - 29 = 10122122011609 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10122122012094 and 10122122012103.
It is not an unprimeable number, because it can be changed into a prime (10122122012221) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 161759586 + ... + 161822148.
It is an arithmetic number, because the mean of its divisors is an integer number (348626628480).
Almost surely, 210122122012121 is an apocalyptic number.
It is an amenable number.
10122122012121 is a deficient number, since it is larger than the sum of its proper divisors (6611956154919).
10122122012121 is a wasteful number, since it uses less digits than its factorization.
10122122012121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66306 (or 66303 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 18.
Adding to 10122122012121 its reverse (12121022122101), we get a palindrome (22243144134222).
The spelling of 10122122012121 in words is "ten trillion, one hundred twenty-two billion, one hundred twenty-two million, twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •