Base | Representation |
---|---|
bin | 10001111100010110010… |
… | …100010000010010101001 |
3 | 11100212122222112002120012 |
4 | 101330112110100102221 |
5 | 130200221141203223 |
6 | 2342240212341305 |
7 | 155040430155125 |
oct | 21742624202251 |
9 | 4325588462505 |
10 | 1233030022313 |
11 | 435a1a3367a1 |
12 | 17ab77314835 |
13 | 8c3746464cb |
14 | 43971152585 |
15 | 22119838c78 |
hex | 11f165104a9 |
1233030022313 has 2 divisors, whose sum is σ = 1233030022314. Its totient is φ = 1233030022312.
The previous prime is 1233030022309. The next prime is 1233030022351. The reversal of 1233030022313 is 3132200303321.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 766381186624 + 466648835689 = 875432^2 + 683117^2 .
It is an emirp because it is prime and its reverse (3132200303321) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1233030022313 - 22 = 1233030022309 is a prime.
It is not a weakly prime, because it can be changed into another prime (1233030022363) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 616515011156 + 616515011157.
It is an arithmetic number, because the mean of its divisors is an integer number (616515011157).
Almost surely, 21233030022313 is an apocalyptic number.
It is an amenable number.
1233030022313 is a deficient number, since it is larger than the sum of its proper divisors (1).
1233030022313 is an equidigital number, since it uses as much as digits as its factorization.
1233030022313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1944, while the sum is 23.
Adding to 1233030022313 its reverse (3132200303321), we get a palindrome (4365230325634).
The spelling of 1233030022313 in words is "one trillion, two hundred thirty-three billion, thirty million, twenty-two thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •