Base | Representation |
---|---|
bin | 10000011100011111110… |
… | …111110011111010111011 |
3 | 11000001000101110022101101 |
4 | 100130133313303322323 |
5 | 122003431421420011 |
6 | 2223055455232231 |
7 | 144435131023354 |
oct | 20343767637273 |
9 | 4001011408341 |
10 | 1130111123131 |
11 | 3a63062a3521 |
12 | 163033b18677 |
13 | 827521a99b3 |
14 | 3c9aa59ad2b |
15 | 1e5e422a2c1 |
hex | 1071fdf3ebb |
1130111123131 has 2 divisors, whose sum is σ = 1130111123132. Its totient is φ = 1130111123130.
The previous prime is 1130111123077. The next prime is 1130111123137. The reversal of 1130111123131 is 1313211110311.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1130111123131 - 219 = 1130110598843 is a prime.
It is a super-2 number, since 2×11301111231312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1130111123099 and 1130111123108.
It is not a weakly prime, because it can be changed into another prime (1130111123137) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 565055561565 + 565055561566.
It is an arithmetic number, because the mean of its divisors is an integer number (565055561566).
Almost surely, 21130111123131 is an apocalyptic number.
1130111123131 is a deficient number, since it is larger than the sum of its proper divisors (1).
1130111123131 is an equidigital number, since it uses as much as digits as its factorization.
1130111123131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 54, while the sum is 19.
Adding to 1130111123131 its reverse (1313211110311), we get a palindrome (2443322233442).
The spelling of 1130111123131 in words is "one trillion, one hundred thirty billion, one hundred eleven million, one hundred twenty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •