Base | Representation |
---|---|
bin | 110011001110100101… |
… | …1000010111101100101 |
3 | 101111221212021222010022 |
4 | 1212131023002331211 |
5 | 3300300320213104 |
6 | 122312143404525 |
7 | 10643114633654 |
oct | 1463513027545 |
9 | 344855258108 |
10 | 110011101029 |
11 | 42723442515 |
12 | 193a25b3745 |
13 | a4b28b596b |
14 | 547887319b |
15 | 2cdd08bbbe |
hex | 199d2c2f65 |
110011101029 has 8 divisors (see below), whose sum is σ = 117004688640. Its totient is φ = 103075551936.
The previous prime is 110011101023. The next prime is 110011101091. The reversal of 110011101029 is 920101110011.
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 110011101029 - 216 = 110011035493 is a prime.
It is a super-2 number, since 2×1100111010292 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 110011100998 and 110011101016.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110011101023) 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, 14505719 + ... + 14513300.
It is an arithmetic number, because the mean of its divisors is an integer number (14625586080).
Almost surely, 2110011101029 is an apocalyptic number.
It is an amenable number.
110011101029 is a deficient number, since it is larger than the sum of its proper divisors (6993587611).
110011101029 is a wasteful number, since it uses less digits than its factorization.
110011101029 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 29019259.
The product of its (nonzero) digits is 18, while the sum is 17.
The spelling of 110011101029 in words is "one hundred ten billion, eleven million, one hundred one thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •