Base | Representation |
---|---|
bin | 11001000110110110101101… |
… | …110011110000101100011111 |
3 | 112110222021002002020100112021 |
4 | 121012312231303300230133 |
5 | 103433124211420140111 |
6 | 1030503134451121011 |
7 | 32154512542402153 |
oct | 3106665563605437 |
9 | 473867062210467 |
10 | 110422230240031 |
11 | 322028942a5996 |
12 | 104746995a3167 |
13 | 497ca05376088 |
14 | 1d3a670699063 |
15 | cb7507a68d71 |
hex | 646dadcf0b1f |
110422230240031 has 2 divisors, whose sum is σ = 110422230240032. Its totient is φ = 110422230240030.
The previous prime is 110422230239969. The next prime is 110422230240059. The reversal of 110422230240031 is 130042032224011.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 110422230240031 - 27 = 110422230239903 is a prime.
It is a super-2 number, since 2×1104222302400312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 110422230239978 and 110422230240005.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110422230240331) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55211115120015 + 55211115120016.
It is an arithmetic number, because the mean of its divisors is an integer number (55211115120016).
Almost surely, 2110422230240031 is an apocalyptic number.
110422230240031 is a deficient number, since it is larger than the sum of its proper divisors (1).
110422230240031 is an equidigital number, since it uses as much as digits as its factorization.
110422230240031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 110422230240031 its reverse (130042032224011), we get a palindrome (240464262464042).
The spelling of 110422230240031 in words is "one hundred ten trillion, four hundred twenty-two billion, two hundred thirty million, two hundred forty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •