Base | Representation |
---|---|
bin | 10110110000101001011000… |
… | …111100101101100110100001 |
3 | 111010102110121010011111210212 |
4 | 112300221120330231212201 |
5 | 101110014300012023014 |
6 | 552521145532103505 |
7 | 30040662214102343 |
oct | 2660513074554641 |
9 | 433373533144725 |
10 | 100100000111009 |
11 | 29993198508718 |
12 | b288073604b95 |
13 | 43b150a994072 |
14 | 1aa0c19ca1293 |
15 | b88c6da2c23e |
hex | 5b0a58f2d9a1 |
100100000111009 has 8 divisors (see below), whose sum is σ = 102693777971232. Its totient is φ = 97539264007200.
The previous prime is 100100000110991. The next prime is 100100000111077. The reversal of 100100000111009 is 900111000001001.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 100100000111009 - 228 = 100099731675553 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100100000110984 and 100100000111002.
It is not an unprimeable number, because it can be changed into a prime (100100000111609) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8260432967 + ... + 8260445084.
It is an arithmetic number, because the mean of its divisors is an integer number (12836722246404).
Almost surely, 2100100000111009 is an apocalyptic number.
It is an amenable number.
100100000111009 is a deficient number, since it is larger than the sum of its proper divisors (2593777860223).
100100000111009 is an equidigital number, since it uses as much as digits as its factorization.
100100000111009 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16520878207.
The product of its (nonzero) digits is 9, while the sum is 14.
The spelling of 100100000111009 in words is "one hundred trillion, one hundred billion, one hundred eleven thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •