Base | Representation |
---|---|
bin | 10110111110010110… |
… | …01111110110100001 |
3 | 1011211120222101200102 |
4 | 23133023033312201 |
5 | 200230023433043 |
6 | 5355524432145 |
7 | 614436663251 |
oct | 133713176641 |
9 | 34746871612 |
10 | 12334202273 |
11 | 525a3767a8 |
12 | 2482848655 |
13 | 1217479253 |
14 | 850175961 |
15 | 4c2c886b8 |
hex | 2df2cfda1 |
12334202273 has 2 divisors, whose sum is σ = 12334202274. Its totient is φ = 12334202272.
The previous prime is 12334202263. The next prime is 12334202357. The reversal of 12334202273 is 37220243321.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7945404769 + 4388797504 = 89137^2 + 66248^2 .
It is an emirp because it is prime and its reverse (37220243321) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12334202273 is a prime.
It is a super-2 number, since 2×123342022732 (a number of 21 digits) contains 22 as substring.
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 (12334202233) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6167101136 + 6167101137.
It is an arithmetic number, because the mean of its divisors is an integer number (6167101137).
Almost surely, 212334202273 is an apocalyptic number.
It is an amenable number.
12334202273 is a deficient number, since it is larger than the sum of its proper divisors (1).
12334202273 is an equidigital number, since it uses as much as digits as its factorization.
12334202273 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12096, while the sum is 29.
Adding to 12334202273 its reverse (37220243321), we get a palindrome (49554445594).
The spelling of 12334202273 in words is "twelve billion, three hundred thirty-four million, two hundred two thousand, two hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •