Base | Representation |
---|---|
bin | 1011001000000100010101… |
… | …1101110011110011101001 |
3 | 1121022111002222210121110112 |
4 | 2302001011131303303221 |
5 | 3100412124432120124 |
6 | 42003511435424105 |
7 | 2401551620610206 |
oct | 262010535636351 |
9 | 47274088717415 |
10 | 12233232301289 |
11 | 39970a279490a |
12 | 1456a708b5035 |
13 | 6a9786941c5c |
14 | 30413d500cad |
15 | 163333b4c90e |
hex | b2045773ce9 |
12233232301289 has 2 divisors, whose sum is σ = 12233232301290. Its totient is φ = 12233232301288.
The previous prime is 12233232301271. The next prime is 12233232301357. The reversal of 12233232301289 is 98210323233221.
It is a happy number.
12233232301289 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9066825587689 + 3166406713600 = 3011117^2 + 1779440^2 .
It is a cyclic number.
It is not a de Polignac number, because 12233232301289 - 212 = 12233232297193 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (12233232301219) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6116616150644 + 6116616150645.
It is an arithmetic number, because the mean of its divisors is an integer number (6116616150645).
Almost surely, 212233232301289 is an apocalyptic number.
It is an amenable number.
12233232301289 is a deficient number, since it is larger than the sum of its proper divisors (1).
12233232301289 is an equidigital number, since it uses as much as digits as its factorization.
12233232301289 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 186624, while the sum is 41.
The spelling of 12233232301289 in words is "twelve trillion, two hundred thirty-three billion, two hundred thirty-two million, three hundred one thousand, two hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •