Base | Representation |
---|---|
bin | 110011001110010010… |
… | …0111001110111101001 |
3 | 101111221011110222110111 |
4 | 1212130210321313221 |
5 | 3300240240233223 |
6 | 122311145214321 |
7 | 10642633641124 |
oct | 1463444716751 |
9 | 344834428414 |
10 | 110001102313 |
11 | 42718833313 |
12 | 1939b1913a1 |
13 | a4b07c486b |
14 | 54773cd3bb |
15 | 2cdc26430d |
hex | 199c939de9 |
110001102313 has 2 divisors, whose sum is σ = 110001102314. Its totient is φ = 110001102312.
The previous prime is 110001102259. The next prime is 110001102331. The reversal of 110001102313 is 313201100011.
Together with next prime (110001102331) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 88308820224 + 21692282089 = 297168^2 + 147283^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-110001102313 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 110001102293 and 110001102302.
It is not a weakly prime, because it can be changed into another prime (110001102373) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55000551156 + 55000551157.
It is an arithmetic number, because the mean of its divisors is an integer number (55000551157).
Almost surely, 2110001102313 is an apocalyptic number.
It is an amenable number.
110001102313 is a deficient number, since it is larger than the sum of its proper divisors (1).
110001102313 is an equidigital number, since it uses as much as digits as its factorization.
110001102313 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 110001102313 its reverse (313201100011), we get a palindrome (423202202324).
The spelling of 110001102313 in words is "one hundred ten billion, one million, one hundred two thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.715 sec. • engine limits •