Base | Representation |
---|---|
bin | 1001001101001011011011… |
… | …1011111000110111101001 |
3 | 1022211122200102112020112121 |
4 | 2103102312323320313221 |
5 | 2311314340044231441 |
6 | 33305553235511241 |
7 | 2063201616164533 |
oct | 223226673706751 |
9 | 38748612466477 |
10 | 10122012102121 |
11 | 32527a2a51257 |
12 | 1175869458521 |
13 | 58566a16655a |
14 | 26dc9d7a0853 |
15 | 12846b89bdd1 |
hex | 934b6ef8de9 |
10122012102121 has 8 divisors (see below), whose sum is σ = 10676449692000. Its totient is φ = 9569744523360.
The previous prime is 10122012102119. The next prime is 10122012102133. The reversal of 10122012102121 is 12120121022101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10122012102121 - 21 = 10122012102119 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10122012102095 and 10122012102104.
It is not an unprimeable number, because it can be changed into a prime (10122012100121) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 542493196 + ... + 542511853.
It is an arithmetic number, because the mean of its divisors is an integer number (1334556211500).
Almost surely, 210122012102121 is an apocalyptic number.
It is an amenable number.
10122012102121 is a deficient number, since it is larger than the sum of its proper divisors (554437589879).
10122012102121 is a wasteful number, since it uses less digits than its factorization.
10122012102121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1085005559.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 10122012102121 its reverse (12120121022101), we get a palindrome (22242133124222).
The spelling of 10122012102121 in words is "ten trillion, one hundred twenty-two billion, twelve million, one hundred two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •