Base | Representation |
---|---|
bin | 110011010111100011… |
… | …1010100001111001011 |
3 | 101112201211200222001111 |
4 | 1212233013110033023 |
5 | 3301404400104344 |
6 | 122402055231151 |
7 | 10653431330116 |
oct | 1465707241713 |
9 | 345654628044 |
10 | 110312113099 |
11 | 42868348321 |
12 | 194673784b7 |
13 | a530079306 |
14 | 54a682b57d |
15 | 2d096ea834 |
hex | 19af1d43cb |
110312113099 has 2 divisors, whose sum is σ = 110312113100. Its totient is φ = 110312113098.
The previous prime is 110312113027. The next prime is 110312113123. The reversal of 110312113099 is 990311213011.
It is a strong prime.
It is an emirp because it is prime and its reverse (990311213011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 110312113099 - 27 = 110312112971 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 110312113099.
It is not a weakly prime, because it can be changed into another prime (110312113799) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55156056549 + 55156056550.
It is an arithmetic number, because the mean of its divisors is an integer number (55156056550).
Almost surely, 2110312113099 is an apocalyptic number.
110312113099 is a deficient number, since it is larger than the sum of its proper divisors (1).
110312113099 is an equidigital number, since it uses as much as digits as its factorization.
110312113099 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1458, while the sum is 31.
The spelling of 110312113099 in words is "one hundred ten billion, three hundred twelve million, one hundred thirteen thousand, ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •