Base | Representation |
---|---|
bin | 110011001110010110… |
… | …1010101100110000101 |
3 | 101111221022122021222212 |
4 | 1212130231111212011 |
5 | 3300241322004104 |
6 | 122311304433205 |
7 | 10642661506301 |
oct | 1463455254605 |
9 | 344838567885 |
10 | 110003313029 |
11 | 4271a003255 |
12 | 1939ba78805 |
13 | a4b10b9b8c |
14 | 5477806d01 |
15 | 2cdc54e36e |
hex | 199cb55985 |
110003313029 has 2 divisors, whose sum is σ = 110003313030. Its totient is φ = 110003313028.
The previous prime is 110003312941. The next prime is 110003313041. The reversal of 110003313029 is 920313300011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 91580680129 + 18422632900 = 302623^2 + 135730^2 .
It is a cyclic number.
It is not a de Polignac number, because 110003313029 - 220 = 110002264453 is a prime.
It is a super-2 number, since 2×1100033130292 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 110003312995 and 110003313013.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110003313829) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55001656514 + 55001656515.
It is an arithmetic number, because the mean of its divisors is an integer number (55001656515).
Almost surely, 2110003313029 is an apocalyptic number.
It is an amenable number.
110003313029 is a deficient number, since it is larger than the sum of its proper divisors (1).
110003313029 is an equidigital number, since it uses as much as digits as its factorization.
110003313029 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 486, while the sum is 23.
The spelling of 110003313029 in words is "one hundred ten billion, three million, three hundred thirteen thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •