Base | Representation |
---|---|
bin | 1001101001101001011110… |
… | …00000100111011010011001 |
3 | 2210010211021010222021012102 |
4 | 10310310233000213122121 |
5 | 10240201102324200441 |
6 | 113045204303253145 |
7 | 4320153306324560 |
oct | 464645700473231 |
9 | 83124233867172 |
10 | 21222222100121 |
11 | 6842326127929 |
12 | 24690132aa1b5 |
13 | bac329744cc3 |
14 | 535237c1cbd7 |
15 | 26c08a92269b |
hex | 134d2f027699 |
21222222100121 has 8 divisors (see below), whose sum is σ = 24253997520384. Its totient is φ = 18190454031360.
The previous prime is 21222222100097. The next prime is 21222222100187. The reversal of 21222222100121 is 12100122222212.
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 21222222100121 - 222 = 21222217905817 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 21222222100093 and 21222222100102.
It is not an unprimeable number, because it can be changed into a prime (21222222600121) 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, 7534361 + ... + 9960473.
It is an arithmetic number, because the mean of its divisors is an integer number (3031749690048).
Almost surely, 221222222100121 is an apocalyptic number.
It is an amenable number.
21222222100121 is a deficient number, since it is larger than the sum of its proper divisors (3031775420263).
21222222100121 is a wasteful number, since it uses less digits than its factorization.
21222222100121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3675751.
The product of its (nonzero) digits is 256, while the sum is 20.
Adding to 21222222100121 its reverse (12100122222212), we get a palindrome (33322344322333).
The spelling of 21222222100121 in words is "twenty-one trillion, two hundred twenty-two billion, two hundred twenty-two million, one hundred thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •