Base | Representation |
---|---|
bin | 10110101111010000111101… |
… | …110011111110011110101101 |
3 | 111010002101112021020100200001 |
4 | 112233100331303332132231 |
5 | 101101440323210234001 |
6 | 552405404400504301 |
7 | 30031061334513145 |
oct | 2657207563763655 |
9 | 433071467210601 |
10 | 100005055555501 |
11 | 299569a6809918 |
12 | b27179691b091 |
13 | 43a55896567c5 |
14 | 1a9a3b0415925 |
15 | b8656354c001 |
hex | 5af43dcfe7ad |
100005055555501 has 32 divisors (see below), whose sum is σ = 106543780992000. Its totient is φ = 93703104004608.
The previous prime is 100005055555463. The next prime is 100005055555511. The reversal of 100005055555501 is 105555550500001.
It is a cyclic number.
It is not a de Polignac number, because 100005055555501 - 217 = 100005055424429 is a prime.
It is a super-2 number, since 2×1000050555555012 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100005055555511) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 136419121 + ... + 137150233.
It is an arithmetic number, because the mean of its divisors is an integer number (3329493156000).
Almost surely, 2100005055555501 is an apocalyptic number.
It is an amenable number.
100005055555501 is a deficient number, since it is larger than the sum of its proper divisors (6538725436499).
100005055555501 is a wasteful number, since it uses less digits than its factorization.
100005055555501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 731893.
The product of its (nonzero) digits is 78125, while the sum is 37.
The spelling of 100005055555501 in words is "one hundred trillion, five billion, fifty-five million, five hundred fifty-five thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •