Base | Representation |
---|---|
bin | 101111000101000000… |
… | …1111011111000000001 |
3 | 100122221211111200200012 |
4 | 1132022001323320001 |
5 | 3124023100323014 |
6 | 114240020034305 |
7 | 10206231625454 |
oct | 1361201737001 |
9 | 318854450605 |
10 | 101100011009 |
11 | 39970358708 |
12 | 17716232995 |
13 | 96c269542a |
14 | 4c711a349b |
15 | 296aac3c3e |
hex | 178a07be01 |
101100011009 has 8 divisors (see below), whose sum is σ = 106436496000. Its totient is φ = 95765069232.
The previous prime is 101100011003. The next prime is 101100011011. The reversal of 101100011009 is 900110001101.
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 101100011009 - 212 = 101100006913 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101100010984 and 101100011002.
It is not an unprimeable number, because it can be changed into a prime (101100011003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 250094 + ... + 514535.
It is an arithmetic number, because the mean of its divisors is an integer number (13304562000).
Almost surely, 2101100011009 is an apocalyptic number.
101100011009 is a gapful number since it is divisible by the number (19) formed by its first and last digit.
It is an amenable number.
101100011009 is a deficient number, since it is larger than the sum of its proper divisors (5336484991).
101100011009 is an equidigital number, since it uses as much as digits as its factorization.
101100011009 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 771607.
The product of its (nonzero) digits is 9, while the sum is 14.
The spelling of 101100011009 in words is "one hundred one billion, one hundred million, eleven thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •