Base | Representation |
---|---|
bin | 10110110111010010000111… |
… | …101101001101100001111001 |
3 | 111012001001202002120122120121 |
4 | 112313102013231031201321 |
5 | 101140002243041010014 |
6 | 553510451231453241 |
7 | 30115635454452535 |
oct | 2667220755154171 |
9 | 435031662518517 |
10 | 100556051110009 |
11 | 2a0496443a7190 |
12 | b34052a087221 |
13 | 4415519885bb1 |
14 | 1ab8d2027abc5 |
15 | b95a61129124 |
hex | 5b7487b4d879 |
100556051110009 has 4 divisors (see below), whose sum is σ = 109697510301840. Its totient is φ = 91414591918180.
The previous prime is 100556051109953. The next prime is 100556051110037. The reversal of 100556051110009 is 900011150655001.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 100556051110009 - 219 = 100556050585721 is a prime.
It is a super-2 number, since 2×1005560511100092 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (100556051110079) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4570729595899 + ... + 4570729595920.
It is an arithmetic number, because the mean of its divisors is an integer number (27424377575460).
Almost surely, 2100556051110009 is an apocalyptic number.
It is an amenable number.
100556051110009 is a deficient number, since it is larger than the sum of its proper divisors (9141459191831).
100556051110009 is an equidigital number, since it uses as much as digits as its factorization.
100556051110009 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9141459191830.
The product of its (nonzero) digits is 6750, while the sum is 34.
The spelling of 100556051110009 in words is "one hundred trillion, five hundred fifty-six billion, fifty-one million, one hundred ten thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •