Base | Representation |
---|---|
bin | 1001101001101001000100… |
… | …11100001000100111100100 |
3 | 2210010210201110010221122001 |
4 | 10310310202130020213210 |
5 | 10240200134332211322 |
6 | 113045131331215044 |
7 | 4320145135643311 |
oct | 464644234104744 |
9 | 83123643127561 |
10 | 21222011210212 |
11 | 684222808714a |
12 | 2468b74747484 |
13 | bac2c4b47087 |
14 | 535217c03d08 |
15 | 26c077166827 |
hex | 134d227089e4 |
21222011210212 has 12 divisors (see below), whose sum is σ = 37138678388140. Its totient is φ = 10610960242176.
The previous prime is 21222011210171. The next prime is 21222011210219. The reversal of 21222011210212 is 21201211022212.
It can be written as a sum of positive squares in 2 ways, for example, as 16796095676416 + 4425915533796 = 4098304^2 + 2103786^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 21222011210212.
It is not an unprimeable number, because it can be changed into a prime (21222011210219) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10277037 + ... + 12168052.
Almost surely, 221222011210212 is an apocalyptic number.
It is an amenable number.
21222011210212 is a deficient number, since it is larger than the sum of its proper divisors (15916667177928).
21222011210212 is a wasteful number, since it uses less digits than its factorization.
21222011210212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22681470 (or 22681468 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 21222011210212 its reverse (21201211022212), we get a palindrome (42423222232424).
The spelling of 21222011210212 in words is "twenty-one trillion, two hundred twenty-two billion, eleven million, two hundred ten thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •