Base | Representation |
---|---|
bin | 11001000000110111110100… |
… | …100010101111100110010001 |
3 | 112102111221212201100100010021 |
4 | 121000313310202233212101 |
5 | 103404410213111213014 |
6 | 1025550222433303441 |
7 | 32113016421025222 |
oct | 3100676442574621 |
9 | 472457781310107 |
10 | 110011100101009 |
11 | 3206449a029398 |
12 | 10408a7aa04b81 |
13 | 4950004b76573 |
14 | 1d247cc22b249 |
15 | cab993e76624 |
hex | 640df48af991 |
110011100101009 has 8 divisors (see below), whose sum is σ = 110097121421088. Its totient is φ = 109925080033440.
The previous prime is 110011100100977. The next prime is 110011100101027. The reversal of 110011100101009 is 900101001110011.
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 110011100101009 - 25 = 110011100100977 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 110011100100983 and 110011100101001.
It is not an unprimeable number, because it can be changed into a prime (110011100105009) 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, 259262229 + ... + 259686205.
It is an arithmetic number, because the mean of its divisors is an integer number (13762140177636).
Almost surely, 2110011100101009 is an apocalyptic number.
It is an amenable number.
110011100101009 is a deficient number, since it is larger than the sum of its proper divisors (86021320079).
110011100101009 is a wasteful number, since it uses less digits than its factorization.
110011100101009 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 626255.
The product of its (nonzero) digits is 9, while the sum is 16.
The spelling of 110011100101009 in words is "one hundred ten trillion, eleven billion, one hundred million, one hundred one thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •