Base | Representation |
---|---|
bin | 11001000100000011101101… |
… | …110111000110111011001111 |
3 | 112110021212222102002011001212 |
4 | 121010003231313012323033 |
5 | 103422002101010043043 |
6 | 1030234551033325035 |
7 | 32134566635543522 |
oct | 3104035567067317 |
9 | 473255872064055 |
10 | 110230031331023 |
11 | 32139325aa492a |
12 | 1044339a56677b |
13 | 4967855305496 |
14 | 1d3123a6a4bb9 |
15 | cb25093ee018 |
hex | 6440eddc6ecf |
110230031331023 has 2 divisors, whose sum is σ = 110230031331024. Its totient is φ = 110230031331022.
The previous prime is 110230031331019. The next prime is 110230031331047. The reversal of 110230031331023 is 320133130032011.
It is a weak prime.
It is an emirp because it is prime and its reverse (320133130032011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 110230031331023 - 22 = 110230031331019 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 110230031331023.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110230031331323) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55115015665511 + 55115015665512.
It is an arithmetic number, because the mean of its divisors is an integer number (55115015665512).
Almost surely, 2110230031331023 is an apocalyptic number.
110230031331023 is a deficient number, since it is larger than the sum of its proper divisors (1).
110230031331023 is an equidigital number, since it uses as much as digits as its factorization.
110230031331023 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 110230031331023 its reverse (320133130032011), we get a palindrome (430363161363034).
The spelling of 110230031331023 in words is "one hundred ten trillion, two hundred thirty billion, thirty-one million, three hundred thirty-one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •