Base | Representation |
---|---|
bin | 10110110010000111011101… |
… | …001000101110100100001000 |
3 | 111010210010022010020012220222 |
4 | 112302013131020232210020 |
5 | 101113143123014213000 |
6 | 553035412131205212 |
7 | 30051166145620433 |
oct | 2662073510564410 |
9 | 433703263205828 |
10 | 100201002101000 |
11 | 29a220084a6719 |
12 | b2a3760a46808 |
13 | 43babb5c59698 |
14 | 1aa5a7c02a81a |
15 | b8b6d0bdca85 |
hex | 5b21dd22e908 |
100201002101000 has 64 divisors (see below), whose sum is σ = 242555529294000. Its totient is φ = 38698318041600.
The previous prime is 100201002100949. The next prime is 100201002101047. The reversal of 100201002101000 is 101200102001.
It can be written as a sum of positive squares in 8 ways, for example, as 1663733660164 + 98537268440836 = 1289858^2 + 9926594^2 .
It is a Harshad number since it is a multiple of its sum of digits (8).
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1727574485 + ... + 1727632484.
Almost surely, 2100201002101000 is an apocalyptic number.
100201002101000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
100201002101000 is an abundant number, since it is smaller than the sum of its proper divisors (142354527193000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100201002101000 is a wasteful number, since it uses less digits than its factorization.
100201002101000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3455207019 (or 3455207005 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 8.
Adding to 100201002101000 its reverse (101200102001), we get a palindrome (100302202203001).
The spelling of 100201002101000 in words is "one hundred trillion, two hundred one billion, two million, one hundred one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •