Base | Representation |
---|---|
bin | 101111110000000011001010… |
… | …100110111110011100111000 |
3 | 1000112120202211100122200100111 |
4 | 233300003022212332130320 |
5 | 210011301211222320440 |
6 | 2022353152311514104 |
7 | 62143505360405365 |
oct | 5760031246763470 |
9 | 1015522740580314 |
10 | 210010120120120 |
11 | 60a08878945401 |
12 | 1b679450388934 |
13 | 9024b3bc71358 |
14 | 39c0788c2346c |
15 | 1942ca26bb4ea |
hex | bf00ca9be738 |
210010120120120 has 64 divisors (see below), whose sum is σ = 474644269139040. Its totient is φ = 83627034777600.
The previous prime is 210010120120081. The next prime is 210010120120127. The reversal of 210010120120120 is 21021021010012.
It is a self number, because there is not a number n which added to its sum of digits gives 210010120120120.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210010120120127) 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, 45137515 + ... + 49572325.
Almost surely, 2210010120120120 is an apocalyptic number.
210010120120120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
210010120120120 is an abundant number, since it is smaller than the sum of its proper divisors (264634149018920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
210010120120120 is a wasteful number, since it uses less digits than its factorization.
210010120120120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4440136 (or 4440132 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 210010120120120 its reverse (21021021010012), we get a palindrome (231031141130132).
The spelling of 210010120120120 in words is "two hundred ten trillion, ten billion, one hundred twenty million, one hundred twenty thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •