Base | Representation |
---|---|
bin | 10000001010000011101… |
… | …110010111001001110011 |
3 | 10221010220112000211012212 |
4 | 100022003232113021303 |
5 | 121142404222443443 |
6 | 2210023045242335 |
7 | 143134361203334 |
oct | 20120356271163 |
9 | 3833815024185 |
10 | 1110311531123 |
11 | 398975a05a43 |
12 | 15b2291033ab |
13 | 8091819cc92 |
14 | 3ba4cb6228b |
15 | 1dd35d99618 |
hex | 10283b97273 |
1110311531123 has 2 divisors, whose sum is σ = 1110311531124. Its totient is φ = 1110311531122.
The previous prime is 1110311531111. The next prime is 1110311531141. The reversal of 1110311531123 is 3211351130111.
It is a weak prime.
It is an emirp because it is prime and its reverse (3211351130111) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1110311531123 - 24 = 1110311531107 is a prime.
It is a super-2 number, since 2×11103115311232 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1110311531023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 555155765561 + 555155765562.
It is an arithmetic number, because the mean of its divisors is an integer number (555155765562).
Almost surely, 21110311531123 is an apocalyptic number.
1110311531123 is a deficient number, since it is larger than the sum of its proper divisors (1).
1110311531123 is an equidigital number, since it uses as much as digits as its factorization.
1110311531123 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 270, while the sum is 23.
Adding to 1110311531123 its reverse (3211351130111), we get a palindrome (4321662661234).
The spelling of 1110311531123 in words is "one trillion, one hundred ten billion, three hundred eleven million, five hundred thirty-one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •