Base | Representation |
---|---|
bin | 10011010000001110111… |
… | …010110101111001110011 |
3 | 11200111011010111220002121 |
4 | 103100032322311321303 |
5 | 133134202124431311 |
6 | 2451453541455111 |
7 | 164406441264412 |
oct | 23201672657163 |
9 | 4614133456077 |
10 | 1323100233331 |
11 | 47013a652418 |
12 | 194513711497 |
13 | 979c9b7c366 |
14 | 480774c9479 |
15 | 2463be33b71 |
hex | 1340eeb5e73 |
1323100233331 has 2 divisors, whose sum is σ = 1323100233332. Its totient is φ = 1323100233330.
The previous prime is 1323100233319. The next prime is 1323100233397. The reversal of 1323100233331 is 1333320013231.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1323100233331 - 211 = 1323100231283 is a prime.
It is a super-2 number, since 2×13231002333312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1323100233296 and 1323100233305.
It is not a weakly prime, because it can be changed into another prime (1323100234331) 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, 661550116665 + 661550116666.
It is an arithmetic number, because the mean of its divisors is an integer number (661550116666).
Almost surely, 21323100233331 is an apocalyptic number.
1323100233331 is a deficient number, since it is larger than the sum of its proper divisors (1).
1323100233331 is an equidigital number, since it uses as much as digits as its factorization.
1323100233331 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 25.
Adding to 1323100233331 its reverse (1333320013231), we get a palindrome (2656420246562).
The spelling of 1323100233331 in words is "one trillion, three hundred twenty-three billion, one hundred million, two hundred thirty-three thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •