Base | Representation |
---|---|
bin | 10011010000010000111… |
… | …000010011100111010111 |
3 | 11200111020102101212021122 |
4 | 103100100320103213113 |
5 | 133134234034414111 |
6 | 2451501114434155 |
7 | 164410320656636 |
oct | 23202070234727 |
9 | 4614212355248 |
10 | 1323133123031 |
11 | 470157176995 |
12 | 19452273295b |
13 | 97a03926715 |
14 | 4807ba0b51d |
15 | 2463ec7dcdb |
hex | 13410e139d7 |
1323133123031 has 2 divisors, whose sum is σ = 1323133123032. Its totient is φ = 1323133123030.
The previous prime is 1323133122979. The next prime is 1323133123033. The reversal of 1323133123031 is 1303213313231.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1323133123031 - 210 = 1323133122007 is a prime.
It is a super-2 number, since 2×13231331230312 (a number of 25 digits) contains 22 as substring.
Together with 1323133123033, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1323133123033) 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, 661566561515 + 661566561516.
It is an arithmetic number, because the mean of its divisors is an integer number (661566561516).
Almost surely, 21323133123031 is an apocalyptic number.
1323133123031 is a deficient number, since it is larger than the sum of its proper divisors (1).
1323133123031 is an equidigital number, since it uses as much as digits as its factorization.
1323133123031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2916, while the sum is 26.
Adding to 1323133123031 its reverse (1303213313231), we get a palindrome (2626346436262).
The spelling of 1323133123031 in words is "one trillion, three hundred twenty-three billion, one hundred thirty-three million, one hundred twenty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •