Base | Representation |
---|---|
bin | 1001001101001011011001… |
… | …0010010011101101010000 |
3 | 1022211122122200000110101102 |
4 | 2103102312102103231100 |
5 | 2311314324301431000 |
6 | 33305552210123532 |
7 | 2063201424426002 |
oct | 223226622235520 |
9 | 38748580013342 |
10 | 10122001202000 |
11 | 3252797886896 |
12 | 11758658805a8 |
13 | 585667b1b08c |
14 | 26dc9c164372 |
15 | 12846a9473d5 |
hex | 934b6493b50 |
10122001202000 has 40 divisors (see below), whose sum is σ = 24474998911272. Its totient is φ = 4048800480000.
The previous prime is 10122001201933. The next prime is 10122001202039. The reversal of 10122001202000 is 20210022101.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 944542959376 + 9177458242624 = 971876^2 + 3029432^2 .
It is a tau number, because it is divible by the number of its divisors (40).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2530498301 + ... + 2530502300.
Almost surely, 210122001202000 is an apocalyptic number.
10122001202000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10122001202000 is an abundant number, since it is smaller than the sum of its proper divisors (14352997709272).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10122001202000 is an equidigital number, since it uses as much as digits as its factorization.
10122001202000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5061000624 (or 5061000608 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 10122001202000 its reverse (20210022101), we get a palindrome (10142211224101).
The spelling of 10122001202000 in words is "ten trillion, one hundred twenty-two billion, one million, two hundred two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •