Base | Representation |
---|---|
bin | 1110100100010100001110… |
… | …01000000001011111100001 |
3 | 11012102102200211000210221121 |
4 | 13102022013020001133201 |
5 | 13144321401034332433 |
6 | 152044135543252241 |
7 | 6514250452546453 |
oct | 722120710013741 |
9 | 135372624023847 |
10 | 32034133120993 |
11 | a230666022943 |
12 | 371451a44a081 |
13 | 14b4a62429323 |
14 | 7ca66316c2d3 |
15 | 3a843469dc2d |
hex | 1d22872017e1 |
32034133120993 has 2 divisors, whose sum is σ = 32034133120994. Its totient is φ = 32034133120992.
The previous prime is 32034133120981. The next prime is 32034133120999. The reversal of 32034133120993 is 39902133143023.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 31840029433809 + 194103687184 = 5642697^2 + 440572^2 .
It is an emirp because it is prime and its reverse (39902133143023) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-32034133120993 is a prime.
It is not a weakly prime, because it can be changed into another prime (32034133120999) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 16017066560496 + 16017066560497.
It is an arithmetic number, because the mean of its divisors is an integer number (16017066560497).
Almost surely, 232034133120993 is an apocalyptic number.
It is an amenable number.
32034133120993 is a deficient number, since it is larger than the sum of its proper divisors (1).
32034133120993 is an equidigital number, since it uses as much as digits as its factorization.
32034133120993 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 314928, while the sum is 43.
The spelling of 32034133120993 in words is "thirty-two trillion, thirty-four billion, one hundred thirty-three million, one hundred twenty thousand, nine hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •