Base | Representation |
---|---|
bin | 1001010001110010000110… |
… | …0010011011001001001000 |
3 | 1100010012211220011210100022 |
4 | 2110130201202123021020 |
5 | 2314113333130001300 |
6 | 33410154130200012 |
7 | 2102002005214430 |
oct | 224344142331110 |
9 | 40105756153308 |
10 | 10201110000200 |
11 | 32832a271a859 |
12 | 1189063123008 |
13 | 58cc6441a042 |
14 | 273a447d32c0 |
15 | 12a54aa76285 |
hex | 9472189b248 |
10201110000200 has 96 divisors (see below), whose sum is σ = 28040489668800. Its totient is φ = 3376919159040.
The previous prime is 10201110000143. The next prime is 10201110000223. The reversal of 10201110000200 is 200001110201.
It is a Harshad number since it is a multiple of its sum of digits (8).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 125588834 + ... + 125670033.
It is an arithmetic number, because the mean of its divisors is an integer number (292088434050).
Almost surely, 210201110000200 is an apocalyptic number.
10201110000200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10201110000200 is an abundant number, since it is smaller than the sum of its proper divisors (17839379668600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10201110000200 is a wasteful number, since it uses less digits than its factorization.
10201110000200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 251258919 (or 251258910 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 8.
Adding to 10201110000200 its reverse (200001110201), we get a palindrome (10401111110401).
The spelling of 10201110000200 in words is "ten trillion, two hundred one billion, one hundred ten million, two hundred", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •