Base | Representation |
---|---|
bin | 110011001110100111… |
… | …0110111000110001001 |
3 | 101111221221011202211022 |
4 | 1212131032313012021 |
5 | 3300301044213001 |
6 | 122312221042225 |
7 | 10643126300225 |
oct | 1463516670611 |
9 | 344857152738 |
10 | 110012101001 |
11 | 42723a65840 |
12 | 193a29b6375 |
13 | a4b2b75b6a |
14 | 5478a53785 |
15 | 2cdd1d811b |
hex | 199d3b7189 |
110012101001 has 8 divisors (see below), whose sum is σ = 126329685600. Its totient is φ = 94747263840.
The previous prime is 110012100971. The next prime is 110012101009. The reversal of 110012101001 is 100101210011.
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 110012101001 - 218 = 110011838857 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 110012101001.
It is not an unprimeable number, because it can be changed into a prime (110012101009) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 263186636 + ... + 263187053.
It is an arithmetic number, because the mean of its divisors is an integer number (15791210700).
Almost surely, 2110012101001 is an apocalyptic number.
110012101001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
110012101001 is a deficient number, since it is larger than the sum of its proper divisors (16317584599).
110012101001 is a wasteful number, since it uses less digits than its factorization.
110012101001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 526373719.
The product of its (nonzero) digits is 2, while the sum is 8.
Adding to 110012101001 its reverse (100101210011), we get a palindrome (210113311012).
The spelling of 110012101001 in words is "one hundred ten billion, twelve million, one hundred one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •