Base | Representation |
---|---|
bin | 1001010001110101110111… |
… | …0110111100001001000000 |
3 | 1100010022110102110021110012 |
4 | 2110131131312330021000 |
5 | 2314122421213324300 |
6 | 33410442401124052 |
7 | 2102036044162010 |
oct | 224353566741100 |
9 | 40108412407405 |
10 | 10202122011200 |
11 | 32837719a7689 |
12 | 11892a6029628 |
13 | 590095ca1212 |
14 | 273adcd89c40 |
15 | 12a5a982b435 |
hex | 9475ddbc240 |
10202122011200 has 168 divisors, whose sum is σ = 28694412910272. Its totient is φ = 3497310996480.
The previous prime is 10202122011161. The next prime is 10202122011259. The reversal of 10202122011200 is 211022120201.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 73256834 + ... + 73395966.
Almost surely, 210202122011200 is an apocalyptic number.
10202122011200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10202122011200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14347206455136).
10202122011200 is an abundant number, since it is smaller than the sum of its proper divisors (18492290899072).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10202122011200 is a wasteful number, since it uses less digits than its factorization.
10202122011200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 145709 (or 145694 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 10202122011200 its reverse (211022120201), we get a palindrome (10413144131401).
The spelling of 10202122011200 in words is "ten trillion, two hundred two billion, one hundred twenty-two million, eleven thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •