Base | Representation |
---|---|
bin | 1001010010011010101010… |
… | …1001010010000100010101 |
3 | 1100011020221212000211102020 |
4 | 2110212222221102010111 |
5 | 2314303134023224341 |
6 | 33415154513203353 |
7 | 2102535612404664 |
oct | 224465251220425 |
9 | 40136855024366 |
10 | 10212000211221 |
11 | 3287980990556 |
12 | 118b1a2260559 |
13 | 590cab6843a3 |
14 | 274398c84ddb |
15 | 12a986b7a566 |
hex | 949aaa52115 |
10212000211221 has 16 divisors (see below), whose sum is σ = 13772498800704. Its totient is φ = 6729915446784.
The previous prime is 10212000211207. The next prime is 10212000211373. The reversal of 10212000211221 is 12211200021201.
It is not a de Polignac number, because 10212000211221 - 26 = 10212000211157 is a prime.
It is a super-2 number, since 2×102120002112212 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10212000211221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10212000611221) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 20321991 + ... + 20818436.
It is an arithmetic number, because the mean of its divisors is an integer number (860781175044).
Almost surely, 210212000211221 is an apocalyptic number.
It is an amenable number.
10212000211221 is a deficient number, since it is larger than the sum of its proper divisors (3560498589483).
10212000211221 is an equidigital number, since it uses as much as digits as its factorization.
10212000211221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 41141380.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 10212000211221 its reverse (12211200021201), we get a palindrome (22423200232422).
The spelling of 10212000211221 in words is "ten trillion, two hundred twelve billion, two hundred eleven thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •