Base | Representation |
---|---|
bin | 110011010111100010… |
… | …0010011010111111011 |
3 | 101112201210012211102102 |
4 | 1212233010103113323 |
5 | 3301404144320011 |
6 | 122402030254015 |
7 | 10653421530032 |
oct | 1465704232773 |
9 | 345653184372 |
10 | 110311323131 |
11 | 42867958859 |
12 | 1946705730b |
13 | a52cb60889 |
14 | 54a66a3719 |
15 | 2d095e173b |
hex | 19af1135fb |
110311323131 has 2 divisors, whose sum is σ = 110311323132. Its totient is φ = 110311323130.
The previous prime is 110311323113. The next prime is 110311323151. The reversal of 110311323131 is 131323113011.
Together with previous prime (110311323113) it forms an Ormiston pair, because they use the same digits, order apart.
It is an a-pointer prime, because the next prime (110311323151) can be obtained adding 110311323131 to its sum of digits (20).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 110311323131 - 214 = 110311306747 is a prime.
It is a super-2 number, since 2×1103113231312 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (110311323151) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55155661565 + 55155661566.
It is an arithmetic number, because the mean of its divisors is an integer number (55155661566).
Almost surely, 2110311323131 is an apocalyptic number.
110311323131 is a deficient number, since it is larger than the sum of its proper divisors (1).
110311323131 is an equidigital number, since it uses as much as digits as its factorization.
110311323131 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 162, while the sum is 20.
Adding to 110311323131 its reverse (131323113011), we get a palindrome (241634436142).
The spelling of 110311323131 in words is "one hundred ten billion, three hundred eleven million, three hundred twenty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •