Base | Representation |
---|---|
bin | 1001000110000101101110… |
… | …1000000111111011110000 |
3 | 1022102000022121021210201122 |
4 | 2101201123220013323300 |
5 | 2302320423101010000 |
6 | 33134012124121412 |
7 | 2051330541633002 |
oct | 221413350077360 |
9 | 38360277253648 |
10 | 10000221110000 |
11 | 3206085125260 |
12 | 1156139996268 |
13 | 57702abc4244 |
14 | 268028648372 |
15 | 1251de56c085 |
hex | 9185ba07ef0 |
10000221110000 has 100 divisors (see below), whose sum is σ = 26412584286264. Its totient is φ = 3636444000000.
The previous prime is 10000221109993. The next prime is 10000221110027. The reversal of 10000221110000 is 1112200001.
It is a tau number, because it is divible by the number of its divisors (100).
It is a Harshad number since it is a multiple of its sum of digits (8).
It is a self number, because there is not a number n which added to its sum of digits gives 10000221110000.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 45345551 + ... + 45565550.
Almost surely, 210000221110000 is an apocalyptic number.
10000221110000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10000221110000 is an abundant number, since it is smaller than the sum of its proper divisors (16412363176264).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10000221110000 is an equidigital number, since it uses as much as digits as its factorization.
10000221110000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 90911140 (or 90911119 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 8.
Adding to 10000221110000 its reverse (1112200001), we get a palindrome (10001333310001).
The spelling of 10000221110000 in words is "ten trillion, two hundred twenty-one million, one hundred ten thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •