Base | Representation |
---|---|
bin | 11000010100000110… |
… | …01101011001101001 |
3 | 1020200201111021202012 |
4 | 30022003031121221 |
5 | 203213144442434 |
6 | 5555142045305 |
7 | 641323023056 |
oct | 141203153151 |
9 | 36621437665 |
10 | 13053515369 |
11 | 5599407334 |
12 | 2643719835 |
13 | 13004bb1bb |
14 | 8bb8da02d |
15 | 515ec33ce |
hex | 30a0cd669 |
13053515369 has 2 divisors, whose sum is σ = 13053515370. Its totient is φ = 13053515368.
The previous prime is 13053515339. The next prime is 13053515389. The reversal of 13053515369 is 96351535031.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12722712025 + 330803344 = 112795^2 + 18188^2 .
It is a cyclic number.
It is not a de Polignac number, because 13053515369 - 28 = 13053515113 is a prime.
It is a super-2 number, since 2×130535153692 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (13053515339) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6526757684 + 6526757685.
It is an arithmetic number, because the mean of its divisors is an integer number (6526757685).
Almost surely, 213053515369 is an apocalyptic number.
It is an amenable number.
13053515369 is a deficient number, since it is larger than the sum of its proper divisors (1).
13053515369 is an equidigital number, since it uses as much as digits as its factorization.
13053515369 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 182250, while the sum is 41.
The spelling of 13053515369 in words is "thirteen billion, fifty-three million, five hundred fifteen thousand, three hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •