Base | Representation |
---|---|
bin | 1001010001110010100000… |
… | …1101101011011000100100 |
3 | 1100010020010200221002012222 |
4 | 2110130220031223120210 |
5 | 2314114100313032322 |
6 | 33410213210531512 |
7 | 2102004535215053 |
oct | 224345015533044 |
9 | 40106120832188 |
10 | 10201222002212 |
11 | 328334a9695aa |
12 | 1189094736b98 |
13 | 58cc816a3717 |
14 | 273a5562a39a |
15 | 12a5557ebe42 |
hex | 9472836b624 |
10201222002212 has 12 divisors (see below), whose sum is σ = 17853031563276. Its totient is φ = 5100355841280.
The previous prime is 10201222002121. The next prime is 10201222002227. The reversal of 10201222002212 is 21220022210201.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 7430781594916 + 2770440407296 = 2725946^2 + 1664464^2 .
It is a super-2 number, since 2×102012220022122 (a number of 27 digits) contains 22 as substring.
It is an unprimeable number.
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, 63699989 + ... + 63859932.
It is an arithmetic number, because the mean of its divisors is an integer number (1487752630273).
Almost surely, 210201222002212 is an apocalyptic number.
It is an amenable number.
10201222002212 is a deficient number, since it is larger than the sum of its proper divisors (7651809561064).
10201222002212 is a wasteful number, since it uses less digits than its factorization.
10201222002212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 127579918 (or 127579916 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 17.
Adding to 10201222002212 its reverse (21220022210201), we get a palindrome (31421244212413).
The spelling of 10201222002212 in words is "ten trillion, two hundred one billion, two hundred twenty-two million, two thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •