Base | Representation |
---|---|
bin | 1001000110000101101100… |
… | …0001100100001101011000 |
3 | 1022102000021220021021102200 |
4 | 2101201123001210031120 |
5 | 2302320413004032300 |
6 | 33134011123330200 |
7 | 2051330360004126 |
oct | 221413301441530 |
9 | 38360256237380 |
10 | 10000211002200 |
11 | 320607a451101 |
12 | 1156136520960 |
13 | 577028a955b3 |
14 | 268027176916 |
15 | 1251dd722200 |
hex | 9185b064358 |
10000211002200 has 72 divisors (see below), whose sum is σ = 33584041955100. Its totient is φ = 2666722933440.
The previous prime is 10000211002193. The next prime is 10000211002219. The reversal of 10000211002200 is 220011200001.
It is a tau number, because it is divible by the number of its divisors (72).
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
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 17 ways as a sum of consecutive naturals, for example, 2777834590 + ... + 2777838189.
Almost surely, 210000211002200 is an apocalyptic number.
10000211002200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10000211002200 is an abundant number, since it is smaller than the sum of its proper divisors (23583830952900).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10000211002200 is a wasteful number, since it uses less digits than its factorization.
10000211002200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5555672801 (or 5555672789 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 10000211002200 its reverse (220011200001), we get a palindrome (10220222202201).
The spelling of 10000211002200 in words is "ten trillion, two hundred eleven million, two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •