Base | Representation |
---|---|
bin | 11001000100000011111111… |
… | …101111100001000111010111 |
3 | 112110021220202022120201201021 |
4 | 121010003333233201013113 |
5 | 103422003204310043111 |
6 | 1030235040511342011 |
7 | 32134610240523232 |
oct | 3104037757410727 |
9 | 473256668521637 |
10 | 110230331331031 |
11 | 3213946a37931a |
12 | 10443462b21907 |
13 | 49678a2503292 |
14 | 1d31268478419 |
15 | cb252590cd71 |
hex | 6440ffbe11d7 |
110230331331031 has 2 divisors, whose sum is σ = 110230331331032. Its totient is φ = 110230331331030.
The previous prime is 110230331330929. The next prime is 110230331331089. The reversal of 110230331331031 is 130133133032011.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 110230331331031 - 217 = 110230331199959 is a prime.
It is a super-2 number, since 2×1102303313310312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 110230331330987 and 110230331331005.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110230331331931) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55115165665515 + 55115165665516.
It is an arithmetic number, because the mean of its divisors is an integer number (55115165665516).
Almost surely, 2110230331331031 is an apocalyptic number.
110230331331031 is a deficient number, since it is larger than the sum of its proper divisors (1).
110230331331031 is an equidigital number, since it uses as much as digits as its factorization.
110230331331031 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1458, while the sum is 25.
Adding to 110230331331031 its reverse (130133133032011), we get a palindrome (240363464363042).
The spelling of 110230331331031 in words is "one hundred ten trillion, two hundred thirty billion, three hundred thirty-one million, three hundred thirty-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •