Base | Representation |
---|---|
bin | 1001000110001001000100… |
… | …1101111000100111110000 |
3 | 1022102002122021002100222201 |
4 | 2101202101031320213300 |
5 | 2302324243232414300 |
6 | 33134241242512544 |
7 | 2051362040035102 |
oct | 221422115704760 |
9 | 38362567070881 |
10 | 10001120201200 |
11 | 32064a6696837 |
12 | 115634ab05754 |
13 | 57714226007b |
14 | 2680b1c09572 |
15 | 12524346966a |
hex | 918913789f0 |
10001120201200 has 60 divisors (see below), whose sum is σ = 24028003555528. Its totient is φ = 4000396089600.
The previous prime is 10001120201179. The next prime is 10001120201201. The reversal of 10001120201200 is 210202110001.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10001120201201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 49952494 + ... + 50152306.
Almost surely, 210001120201200 is an apocalyptic number.
10001120201200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10001120201200 is an abundant number, since it is smaller than the sum of its proper divisors (14026883354328).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10001120201200 is a wasteful number, since it uses less digits than its factorization.
10001120201200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 324962 (or 324951 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 10001120201200 its reverse (210202110001), we get a palindrome (10211322311201).
The spelling of 10001120201200 in words is "ten trillion, one billion, one hundred twenty million, two hundred one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •