Base | Representation |
---|---|
bin | 1001010001110101011111… |
… | …0001110110000001011000 |
3 | 1100010022012022112012000111 |
4 | 2110131113301312001120 |
5 | 2314122214110341440 |
6 | 33410424315014104 |
7 | 2102033365202416 |
oct | 224352761660130 |
9 | 40108168465014 |
10 | 10202020012120 |
11 | 328371a370222 |
12 | 1189277a3a334 |
13 | 59007ab0a831 |
14 | 273acd5d82b6 |
15 | 12a5a08ce4ea |
hex | 94757c76058 |
10202020012120 has 16 divisors (see below), whose sum is σ = 22954545027360. Its totient is φ = 4080808004832.
The previous prime is 10202020012117. The next prime is 10202020012147. The reversal of 10202020012120 is 2121002020201.
It is a happy number.
It is a self number, because there is not a number n which added to its sum of digits gives 10202020012120.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 127525250112 + ... + 127525250191.
It is an arithmetic number, because the mean of its divisors is an integer number (1434659064210).
Almost surely, 210202020012120 is an apocalyptic number.
10202020012120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10202020012120 is an abundant number, since it is smaller than the sum of its proper divisors (12752525015240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10202020012120 is a wasteful number, since it uses less digits than its factorization.
10202020012120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 255050500314 (or 255050500310 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 10202020012120 its reverse (2121002020201), we get a palindrome (12323022032321).
The spelling of 10202020012120 in words is "ten trillion, two hundred two billion, twenty million, twelve thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •