Base | Representation |
---|---|
bin | 10010111100110111110… |
… | …110000100010101110011 |
3 | 11121111111100210210020202 |
4 | 102330313312010111303 |
5 | 132314113333323443 |
6 | 2434135054025415 |
7 | 163042335306524 |
oct | 22746766042563 |
9 | 4544440723222 |
10 | 1302312011123 |
11 | 4623421a7392 |
12 | 1904917a826b |
13 | 95a660b6666 |
14 | 4706466284b |
15 | 23d21dba7b8 |
hex | 12f37d84573 |
1302312011123 has 2 divisors, whose sum is σ = 1302312011124. Its totient is φ = 1302312011122.
The previous prime is 1302312011087. The next prime is 1302312011173. The reversal of 1302312011123 is 3211102132031.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1302312011123 - 212 = 1302312007027 is a prime.
It is a super-2 number, since 2×13023120111232 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1302312011095 and 1302312011104.
It is not a weakly prime, because it can be changed into another prime (1302312011173) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 651156005561 + 651156005562.
It is an arithmetic number, because the mean of its divisors is an integer number (651156005562).
Almost surely, 21302312011123 is an apocalyptic number.
1302312011123 is a deficient number, since it is larger than the sum of its proper divisors (1).
1302312011123 is an equidigital number, since it uses as much as digits as its factorization.
1302312011123 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 1302312011123 its reverse (3211102132031), we get a palindrome (4513414143154).
The spelling of 1302312011123 in words is "one trillion, three hundred two billion, three hundred twelve million, eleven thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •