Base | Representation |
---|---|
bin | 11001000011110010000001… |
… | …010111110010101001111111 |
3 | 112110020001221021012020020111 |
4 | 121003302001113302221333 |
5 | 103421144143004004043 |
6 | 1030222125425130451 |
7 | 32133325045214164 |
oct | 3103620127625177 |
9 | 473201837166214 |
10 | 110211031313023 |
11 | 32131265a87113 |
12 | 1043b777489a27 |
13 | 4965b17b5c794 |
14 | 1d3035712406b |
15 | cb1c9635e09d |
hex | 643c815f2a7f |
110211031313023 has 2 divisors, whose sum is σ = 110211031313024. Its totient is φ = 110211031313022.
The previous prime is 110211031313011. The next prime is 110211031313063. The reversal of 110211031313023 is 320313130112011.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 110211031313023 - 213 = 110211031304831 is a prime.
It is a super-2 number, since 2×1102110313130232 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 110211031312985 and 110211031313003.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110211031313003) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55105515656511 + 55105515656512.
It is an arithmetic number, because the mean of its divisors is an integer number (55105515656512).
Almost surely, 2110211031313023 is an apocalyptic number.
110211031313023 is a deficient number, since it is larger than the sum of its proper divisors (1).
110211031313023 is an equidigital number, since it uses as much as digits as its factorization.
110211031313023 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 110211031313023 its reverse (320313130112011), we get a palindrome (430524161425034).
The spelling of 110211031313023 in words is "one hundred ten trillion, two hundred eleven billion, thirty-one million, three hundred thirteen thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •