Base | Representation |
---|---|
bin | 1100000010010101010010… |
… | …0000011101001100001101 |
3 | 1201212011210222202120121002 |
4 | 3000211110200131030031 |
5 | 3213312131240031133 |
6 | 44051414005150045 |
7 | 2534066053133606 |
oct | 300452440351415 |
9 | 51764728676532 |
10 | 13234212033293 |
11 | 424266374a979 |
12 | 1598a669bb325 |
13 | 74cc99b9c574 |
14 | 33a779adadad |
15 | 17e3bb3dece8 |
hex | c095481d30d |
13234212033293 has 2 divisors, whose sum is σ = 13234212033294. Its totient is φ = 13234212033292.
The previous prime is 13234212033271. The next prime is 13234212033299. The reversal of 13234212033293 is 39233021243231.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12866009434084 + 368202599209 = 3586922^2 + 606797^2 .
It is an emirp because it is prime and its reverse (39233021243231) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 13234212033293 - 210 = 13234212032269 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13234212033299) 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, 6617106016646 + 6617106016647.
It is an arithmetic number, because the mean of its divisors is an integer number (6617106016647).
Almost surely, 213234212033293 is an apocalyptic number.
It is an amenable number.
13234212033293 is a deficient number, since it is larger than the sum of its proper divisors (1).
13234212033293 is an equidigital number, since it uses as much as digits as its factorization.
13234212033293 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 139968, while the sum is 38.
The spelling of 13234212033293 in words is "thirteen trillion, two hundred thirty-four billion, two hundred twelve million, thirty-three thousand, two hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •