Base | Representation |
---|---|
bin | 110011001110111100… |
… | …0110100101010000011 |
3 | 101111222200212122001212 |
4 | 1212131320310222003 |
5 | 3300311403213214 |
6 | 122313252520335 |
7 | 10643321633324 |
oct | 1463570645203 |
9 | 344880778055 |
10 | 110023101059 |
11 | 4272a1992a3 |
12 | 193a66200ab |
13 | a4b5227981 |
14 | 547a2b844b |
15 | 2cde15c53e |
hex | 199de34a83 |
110023101059 has 2 divisors, whose sum is σ = 110023101060. Its totient is φ = 110023101058.
The previous prime is 110023101007. The next prime is 110023101061. The reversal of 110023101059 is 950101320011.
It is a strong prime.
It is an emirp because it is prime and its reverse (950101320011) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-110023101059 is a prime.
It is a Sophie Germain prime.
Together with 110023101061, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (110023101959) 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, 55011550529 + 55011550530.
It is an arithmetic number, because the mean of its divisors is an integer number (55011550530).
Almost surely, 2110023101059 is an apocalyptic number.
110023101059 is a deficient number, since it is larger than the sum of its proper divisors (1).
110023101059 is an equidigital number, since it uses as much as digits as its factorization.
110023101059 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 270, while the sum is 23.
The spelling of 110023101059 in words is "one hundred ten billion, twenty-three million, one hundred one thousand, fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •