Base | Representation |
---|---|
bin | 10110101111001110010011… |
… | …100110111110100010000000 |
3 | 111010002010011021001011220102 |
4 | 112233032103212332202000 |
5 | 101101414001201133440 |
6 | 552404213152501532 |
7 | 30030630512050055 |
oct | 2657162346764200 |
9 | 433063137034812 |
10 | 100002200021120 |
11 | 29955770950651 |
12 | b27111a54a8a8 |
13 | 43a5222b840a7 |
14 | 1a9a1bd09702c |
15 | b864479e2b15 |
hex | 5af3939be880 |
100002200021120 has 64 divisors (see below), whose sum is σ = 239091852346200. Its totient is φ = 39996848775168.
The previous prime is 100002200021117. The next prime is 100002200021159. The reversal of 100002200021120 is 21120002200001.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 93895014723136 + 6107185297984 = 9689944^2 + 2471272^2 .
It is a tau number, because it is divible by the number of its divisors (64).
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1513979 + ... + 14223098.
Almost surely, 2100002200021120 is an apocalyptic number.
100002200021120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
100002200021120 is an abundant number, since it is smaller than the sum of its proper divisors (139089652325080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100002200021120 is an equidigital number, since it uses as much as digits as its factorization.
100002200021120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15747025 (or 15747013 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 100002200021120 its reverse (21120002200001), we get a palindrome (121122202221121).
The spelling of 100002200021120 in words is "one hundred trillion, two billion, two hundred million, twenty-one thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •