Base | Representation |
---|---|
bin | 1001010010010111110000… |
… | …1001110111000010101001 |
3 | 1100011011221111100021112001 |
4 | 2110211330021313002221 |
5 | 2314300034334101441 |
6 | 33414545251251001 |
7 | 2102510361534202 |
oct | 224457411670251 |
9 | 40134844307461 |
10 | 10211220222121 |
11 | 3287610678166 |
12 | 118b004ba9a61 |
13 | 590bb5bb9889 |
14 | 2743234485a9 |
15 | 12a93d457731 |
hex | 9497c2770a9 |
10211220222121 has 8 divisors (see below), whose sum is σ = 10318770538560. Its totient is φ = 10103922076752.
The previous prime is 10211220222113. The next prime is 10211220222163. The reversal of 10211220222121 is 12122202211201.
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 10211220222121 - 23 = 10211220222113 is a prime.
It is a super-3 number, since 3×102112202221213 (a number of 40 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10211220222821) 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, 62961355 + ... + 63123328.
It is an arithmetic number, because the mean of its divisors is an integer number (1289846317320).
Almost surely, 210211220222121 is an apocalyptic number.
It is an amenable number.
10211220222121 is a deficient number, since it is larger than the sum of its proper divisors (107550316439).
10211220222121 is a wasteful number, since it uses less digits than its factorization.
10211220222121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 126085535.
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 10211220222121 its reverse (12122202211201), we get a palindrome (22333422433322).
The spelling of 10211220222121 in words is "ten trillion, two hundred eleven billion, two hundred twenty million, two hundred twenty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •