Base | Representation |
---|---|
bin | 1011001101111000000010… |
… | …1100010101010010101101 |
3 | 1121200000122200112122111111 |
4 | 2303132000230111102231 |
5 | 3104031001103241023 |
6 | 42121412350352021 |
7 | 2412013330061131 |
oct | 263360054252255 |
9 | 47600580478444 |
10 | 12333010212013 |
11 | 3a2544481aa57 |
12 | 14722781bb611 |
13 | 6b5cc843200a |
14 | 308cc6c6d3c1 |
15 | 165c2361800d |
hex | b3780b154ad |
12333010212013 has 2 divisors, whose sum is σ = 12333010212014. Its totient is φ = 12333010212012.
The previous prime is 12333010212001. The next prime is 12333010212041. The reversal of 12333010212013 is 31021201033321.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8794706254569 + 3538303957444 = 2965587^2 + 1881038^2 .
It is an emirp because it is prime and its reverse (31021201033321) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12333010212013 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12333010212073) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6166505106006 + 6166505106007.
It is an arithmetic number, because the mean of its divisors is an integer number (6166505106007).
Almost surely, 212333010212013 is an apocalyptic number.
It is an amenable number.
12333010212013 is a deficient number, since it is larger than the sum of its proper divisors (1).
12333010212013 is an equidigital number, since it uses as much as digits as its factorization.
12333010212013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 12333010212013 its reverse (31021201033321), we get a palindrome (43354211245334).
The spelling of 12333010212013 in words is "twelve trillion, three hundred thirty-three billion, ten million, two hundred twelve thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •