Base | Representation |
---|---|
bin | 1011111101100100101010… |
… | …0000101001010010111001 |
3 | 1201120100202011010102202012 |
4 | 2333121022200221102321 |
5 | 3210442144110311324 |
6 | 43550051505215305 |
7 | 2525142502552313 |
oct | 277311240512271 |
9 | 51510664112665 |
10 | 13152439932089 |
11 | 4210a11504a47 |
12 | 1585045631535 |
13 | 745367895173 |
14 | 33681d86c7b3 |
15 | 17c1d257920e |
hex | bf64a8294b9 |
13152439932089 has 2 divisors, whose sum is σ = 13152439932090. Its totient is φ = 13152439932088.
The previous prime is 13152439932061. The next prime is 13152439932091. The reversal of 13152439932089 is 98023993425131.
13152439932089 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12706316126464 + 446123805625 = 3564592^2 + 667925^2 .
It is a cyclic number.
It is not a de Polignac number, because 13152439932089 - 220 = 13152438883513 is a prime.
Together with 13152439932091, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (13152439932059) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6576219966044 + 6576219966045.
It is an arithmetic number, because the mean of its divisors is an integer number (6576219966045).
Almost surely, 213152439932089 is an apocalyptic number.
It is an amenable number.
13152439932089 is a deficient number, since it is larger than the sum of its proper divisors (1).
13152439932089 is an equidigital number, since it uses as much as digits as its factorization.
13152439932089 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 12597120, while the sum is 59.
The spelling of 13152439932089 in words is "thirteen trillion, one hundred fifty-two billion, four hundred thirty-nine million, nine hundred thirty-two thousand, eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •