Base | Representation |
---|---|
bin | 1001001100011111111000… |
… | …1010001001011010001011 |
3 | 1022210112111201202122020002 |
4 | 2103013332022021122023 |
5 | 2311121414430322311 |
6 | 33300341242553215 |
7 | 2062306131034136 |
oct | 223077612113213 |
9 | 38715451678202 |
10 | 10110322120331 |
11 | 3248844296984 |
12 | 117354650880b |
13 | 5845262c9774 |
14 | 26d4b100321d |
15 | 127ed546893b |
hex | 931fe28968b |
10110322120331 has 2 divisors, whose sum is σ = 10110322120332. Its totient is φ = 10110322120330.
The previous prime is 10110322120291. The next prime is 10110322120357. The reversal of 10110322120331 is 13302122301101.
It is a happy number.
10110322120331 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10110322120331 is a prime.
It is a super-2 number, since 2×101103221203312 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10110322120361) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5055161060165 + 5055161060166.
It is an arithmetic number, because the mean of its divisors is an integer number (5055161060166).
Almost surely, 210110322120331 is an apocalyptic number.
10110322120331 is a deficient number, since it is larger than the sum of its proper divisors (1).
10110322120331 is an equidigital number, since it uses as much as digits as its factorization.
10110322120331 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 10110322120331 its reverse (13302122301101), we get a palindrome (23412444421432).
The spelling of 10110322120331 in words is "ten trillion, one hundred ten billion, three hundred twenty-two million, one hundred twenty thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •