Base | Representation |
---|---|
bin | 110000000000111011… |
… | …0101000000001000001 |
3 | 100212010221020120012111 |
4 | 1200001312220001001 |
5 | 3142132214441001 |
6 | 115211311455321 |
7 | 10310112122344 |
oct | 1400166500101 |
9 | 325127216174 |
10 | 103110312001 |
11 | 3a8020a0594 |
12 | 17b97527541 |
13 | 9953008348 |
14 | 4dc218045b |
15 | 2a3731d851 |
hex | 1801da8041 |
103110312001 has 2 divisors, whose sum is σ = 103110312002. Its totient is φ = 103110312000.
The previous prime is 103110311977. The next prime is 103110312023. The reversal of 103110312001 is 100213011301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 100567631376 + 2542680625 = 317124^2 + 50425^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-103110312001 is a prime.
It is not a weakly prime, because it can be changed into another prime (103110312061) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51555156000 + 51555156001.
It is an arithmetic number, because the mean of its divisors is an integer number (51555156001).
Almost surely, 2103110312001 is an apocalyptic number.
It is an amenable number.
103110312001 is a deficient number, since it is larger than the sum of its proper divisors (1).
103110312001 is an equidigital number, since it uses as much as digits as its factorization.
103110312001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18, while the sum is 13.
Adding to 103110312001 its reverse (100213011301), we get a palindrome (203323323302).
The spelling of 103110312001 in words is "one hundred three billion, one hundred ten million, three hundred twelve thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •