Base | Representation |
---|---|
bin | 11001000010100111100110… |
… | …011011000110110001000111 |
3 | 112102221102200021021212200111 |
4 | 121002213212123012301013 |
5 | 103413342014302131043 |
6 | 1030121312241453451 |
7 | 32124465606634504 |
oct | 3102474633066107 |
9 | 472842607255614 |
10 | 110131122302023 |
11 | 3210038a477459 |
12 | 10428196041287 |
13 | 495b421834b14 |
14 | 1d2a5364b24ab |
15 | caeb6ad6509d |
hex | 6429e66c6c47 |
110131122302023 has 2 divisors, whose sum is σ = 110131122302024. Its totient is φ = 110131122302022.
The previous prime is 110131122302009. The next prime is 110131122302027. The reversal of 110131122302023 is 320203221131011.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 110131122302023 - 233 = 110122532367431 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 110131122301985 and 110131122302003.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110131122302027) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55065561151011 + 55065561151012.
It is an arithmetic number, because the mean of its divisors is an integer number (55065561151012).
Almost surely, 2110131122302023 is an apocalyptic number.
110131122302023 is a deficient number, since it is larger than the sum of its proper divisors (1).
110131122302023 is an equidigital number, since it uses as much as digits as its factorization.
110131122302023 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 110131122302023 its reverse (320203221131011), we get a palindrome (430334343433034).
The spelling of 110131122302023 in words is "one hundred ten trillion, one hundred thirty-one billion, one hundred twenty-two million, three hundred two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •