Base | Representation |
---|---|
bin | 1001000110001100011001… |
… | …0100110110100010000100 |
3 | 1022102011221100200211010201 |
4 | 2101203012110312202010 |
5 | 2302333104333020400 |
6 | 33134505512300244 |
7 | 2051423106416614 |
oct | 221430624664204 |
9 | 38364840624121 |
10 | 10002011220100 |
11 | 3206913644499 |
12 | 11565593a1684 |
13 | 577254a308a3 |
14 | 2681582a8a44 |
15 | 1252967c006a |
hex | 918c6536884 |
10002011220100 has 36 divisors (see below), whose sum is σ = 22072234942800. Its totient is φ = 3932994240160.
The previous prime is 10002011220079. The next prime is 10002011220169. The reversal of 10002011220100 is 102211020001.
It is a Harshad number since it is a multiple of its sum of digits (10).
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 11 ways as a sum of consecutive naturals, for example, 847622170 + ... + 847633969.
It is an arithmetic number, because the mean of its divisors is an integer number (613117637300).
Almost surely, 210002011220100 is an apocalyptic number.
10002011220100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10002011220100 is an abundant number, since it is smaller than the sum of its proper divisors (12070223722700).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10002011220100 is a wasteful number, since it uses less digits than its factorization.
10002011220100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1695256212 (or 1695256205 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 10002011220100 its reverse (102211020001), we get a palindrome (10104222240101).
The spelling of 10002011220100 in words is "ten trillion, two billion, eleven million, two hundred twenty thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •