Base | Representation |
---|---|
bin | 10000010110001011101… |
… | …111101111101000001011 |
3 | 10222101111212111000222012 |
4 | 100112023233233220023 |
5 | 121401040214410011 |
6 | 2220015014050135 |
7 | 144105122031665 |
oct | 20261357575013 |
9 | 3871455430865 |
10 | 1123331013131 |
11 | 3a3447087528 |
12 | 16186134994b |
13 | 81c116033a2 |
14 | 3c525d1d535 |
15 | 1e348d98a8b |
hex | 1058bbefa0b |
1123331013131 has 2 divisors, whose sum is σ = 1123331013132. Its totient is φ = 1123331013130.
The previous prime is 1123331013073. The next prime is 1123331013149. The reversal of 1123331013131 is 1313101333211.
It is a strong prime.
It is an emirp because it is prime and its reverse (1313101333211) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1123331013131 - 210 = 1123331012107 is a prime.
It is a super-2 number, since 2×11233310131312 (a number of 25 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 1123331013097 and 1123331013106.
It is not a weakly prime, because it can be changed into another prime (1123331013151) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 561665506565 + 561665506566.
It is an arithmetic number, because the mean of its divisors is an integer number (561665506566).
Almost surely, 21123331013131 is an apocalyptic number.
1123331013131 is a deficient number, since it is larger than the sum of its proper divisors (1).
1123331013131 is an equidigital number, since it uses as much as digits as its factorization.
1123331013131 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 486, while the sum is 23.
Adding to 1123331013131 its reverse (1313101333211), we get a palindrome (2436432346342).
The spelling of 1123331013131 in words is "one trillion, one hundred twenty-three billion, three hundred thirty-one million, thirteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •