Base | Representation |
---|---|
bin | 1001010001110010100000… |
… | …1101101101100010001100 |
3 | 1100010020010200221112022012 |
4 | 2110130220031231202030 |
5 | 2314114100313323040 |
6 | 33410213211040352 |
7 | 2102004535252535 |
oct | 224345015554214 |
9 | 40106120845265 |
10 | 10201222011020 |
11 | 328334a975187 |
12 | 11890947400b8 |
13 | 58cc816a7731 |
14 | 273a5562d68c |
15 | 12a5557ee865 |
hex | 9472836d88c |
10201222011020 has 48 divisors (see below), whose sum is σ = 21569741968320. Its totient is φ = 4052549566464.
The previous prime is 10201222011007. The next prime is 10201222011083. The reversal of 10201222011020 is 2011022210201.
It is a junction number, because it is equal to n+sod(n) for n = 10201222010986 and 10201222011004.
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 15 ways as a sum of consecutive naturals, for example, 1212440 + ... + 4676799.
It is an arithmetic number, because the mean of its divisors is an integer number (449369624340).
Almost surely, 210201222011020 is an apocalyptic number.
10201222011020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10201222011020 is an abundant number, since it is smaller than the sum of its proper divisors (11368519957300).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10201222011020 is a wasteful number, since it uses less digits than its factorization.
10201222011020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5889842 (or 5889840 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 10201222011020 its reverse (2011022210201), we get a palindrome (12212244221221).
The spelling of 10201222011020 in words is "ten trillion, two hundred one billion, two hundred twenty-two million, eleven thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •