Base | Representation |
---|---|
bin | 1011111100110111100001… |
… | …0011011111000100101001 |
3 | 1201112012110201121101200111 |
4 | 2333031320103133010221 |
5 | 3210242340233114033 |
6 | 43540325312334321 |
7 | 2524233314265625 |
oct | 277157023370451 |
9 | 51465421541614 |
10 | 13140323332393 |
11 | 4206863a54294 |
12 | 15828238443a1 |
13 | 74418652734a |
14 | 335dd057c185 |
15 | 17bc239757cd |
hex | bf3784df129 |
13140323332393 has 2 divisors, whose sum is σ = 13140323332394. Its totient is φ = 13140323332392.
The previous prime is 13140323332379. The next prime is 13140323332399. The reversal of 13140323332393 is 39323332304131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12281639403289 + 858683929104 = 3504517^2 + 926652^2 .
It is a cyclic number.
It is not a de Polignac number, because 13140323332393 - 213 = 13140323324201 is a prime.
It is not a weakly prime, because it can be changed into another prime (13140323332399) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6570161666196 + 6570161666197.
It is an arithmetic number, because the mean of its divisors is an integer number (6570161666197).
Almost surely, 213140323332393 is an apocalyptic number.
It is an amenable number.
13140323332393 is a deficient number, since it is larger than the sum of its proper divisors (1).
13140323332393 is an equidigital number, since it uses as much as digits as its factorization.
13140323332393 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 40.
The spelling of 13140323332393 in words is "thirteen trillion, one hundred forty billion, three hundred twenty-three million, three hundred thirty-two thousand, three hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •