Base | Representation |
---|---|
bin | 1001010001110010111000… |
… | …0011111101111011000000 |
3 | 1100010020101112112222112010 |
4 | 2110130232003331323000 |
5 | 2314114300422320000 |
6 | 33410231033532520 |
7 | 2102010136210542 |
oct | 224345603757300 |
9 | 40106345488463 |
10 | 10201320120000 |
11 | 32833a0294989 |
12 | 1189101574140 |
13 | 58cc98b08599 |
14 | 273a6468b692 |
15 | 12a55e22dd50 |
hex | 9472e0fdec0 |
10201320120000 has 140 divisors (see below), whose sum is σ = 33727945021496. Its totient is φ = 2720352000000.
The previous prime is 10201320119987. The next prime is 10201320120007. The reversal of 10201320120000 is 2102310201.
10201320120000 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is not an unprimeable number, because it can be changed into a prime (10201320120007) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 42385501 + ... + 42625500.
Almost surely, 210201320120000 is an apocalyptic number.
10201320120000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10201320120000 is an abundant number, since it is smaller than the sum of its proper divisors (23526624901496).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10201320120000 is an frugal number, since it uses more digits than its factorization.
10201320120000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 85011036 (or 85011011 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 12.
Adding to 10201320120000 its reverse (2102310201), we get a palindrome (10203422430201).
The spelling of 10201320120000 in words is "ten trillion, two hundred one billion, three hundred twenty million, one hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •