Base | Representation |
---|---|
bin | 10110101111001100010001… |
… | …101110101011001100101001 |
3 | 111010001220112101211111020120 |
4 | 112233030101232223030221 |
5 | 101101400020334013001 |
6 | 552403213032513453 |
7 | 30030522512510532 |
oct | 2657142156531451 |
9 | 433056471744216 |
10 | 100000021001001 |
11 | 29954852950580 |
12 | b27081084b889 |
13 | 43a4c665b9b84 |
14 | 1a9a05391b689 |
15 | b8636b56c236 |
hex | 5af311bab329 |
100000021001001 has 16 divisors (see below), whose sum is σ = 145720489329408. Its totient is φ = 60495276114000.
The previous prime is 100000021000981. The next prime is 100000021001011. The reversal of 100000021001001 is 100100120000001.
It is not a de Polignac number, because 100000021001001 - 215 = 100000020968233 is a prime.
It is not an unprimeable number, because it can be changed into a prime (100000021001011) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2769912175 + ... + 2769948276.
It is an arithmetic number, because the mean of its divisors is an integer number (9107530583088).
Almost surely, 2100000021001001 is an apocalyptic number.
100000021001001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
100000021001001 is a deficient number, since it is larger than the sum of its proper divisors (45720468328407).
100000021001001 is a wasteful number, since it uses less digits than its factorization.
100000021001001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5539861012.
The product of its (nonzero) digits is 2, while the sum is 6.
Adding to 100000021001001 its reverse (100100120000001), we get a palindrome (200100141001002).
The spelling of 100000021001001 in words is "one hundred trillion, twenty-one million, one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •