Base | Representation |
---|---|
bin | 11001000010001010110011… |
… | …011111110101001000011111 |
3 | 112102211110212110102021021211 |
4 | 121002022303133311020133 |
5 | 103412340204000201143 |
6 | 1030055200212405251 |
7 | 32122322446214131 |
oct | 3102126337651037 |
9 | 472743773367254 |
10 | 110100203131423 |
11 | 320992633a79aa |
12 | 104221a7316827 |
13 | 4958534bc35bb |
14 | 1d28c41d5b051 |
15 | cade5b6c449d |
hex | 6422b37f521f |
110100203131423 has 2 divisors, whose sum is σ = 110100203131424. Its totient is φ = 110100203131422.
The previous prime is 110100203131301. The next prime is 110100203131441. The reversal of 110100203131423 is 324131302001011.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 110100203131423 - 217 = 110100203000351 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 110100203131394 and 110100203131403.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110100203131493) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55050101565711 + 55050101565712.
It is an arithmetic number, because the mean of its divisors is an integer number (55050101565712).
Almost surely, 2110100203131423 is an apocalyptic number.
110100203131423 is a deficient number, since it is larger than the sum of its proper divisors (1).
110100203131423 is an equidigital number, since it uses as much as digits as its factorization.
110100203131423 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 110100203131423 its reverse (324131302001011), we get a palindrome (434231505132434).
The spelling of 110100203131423 in words is "one hundred ten trillion, one hundred billion, two hundred three million, one hundred thirty-one thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •