Base | Representation |
---|---|
bin | 1011110110100011111110… |
… | …1110110101111101110101 |
3 | 1201010211212111011222210001 |
4 | 2331220333232311331311 |
5 | 3202004014001122331 |
6 | 43414452420031301 |
7 | 2513350052315341 |
oct | 275507756657565 |
9 | 51124774158701 |
10 | 13032000020341 |
11 | 41749272a46a5 |
12 | 1565832532531 |
13 | 736bb2503bb3 |
14 | 330a75d32621 |
15 | 178ed3b79561 |
hex | bda3fbb5f75 |
13032000020341 has 2 divisors, whose sum is σ = 13032000020342. Its totient is φ = 13032000020340.
The previous prime is 13032000020339. The next prime is 13032000020357. The reversal of 13032000020341 is 14302000023031.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12492760940100 + 539239080241 = 3534510^2 + 734329^2 .
It is a cyclic number.
It is not a de Polignac number, because 13032000020341 - 21 = 13032000020339 is a prime.
Together with 13032000020339, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13032000024341) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6516000010170 + 6516000010171.
It is an arithmetic number, because the mean of its divisors is an integer number (6516000010171).
Almost surely, 213032000020341 is an apocalyptic number.
It is an amenable number.
13032000020341 is a deficient number, since it is larger than the sum of its proper divisors (1).
13032000020341 is an equidigital number, since it uses as much as digits as its factorization.
13032000020341 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 13032000020341 its reverse (14302000023031), we get a palindrome (27334000043372).
The spelling of 13032000020341 in words is "thirteen trillion, thirty-two billion, twenty thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •