Base | Representation |
---|---|
bin | 11000011011011011… |
… | …11110110010101001 |
3 | 1020212000022001020121 |
4 | 30031231332302221 |
5 | 203324423344434 |
6 | 10005221123241 |
7 | 643001110456 |
oct | 141555766251 |
9 | 36760261217 |
10 | 13115059369 |
11 | 5620122245 |
12 | 2660259521 |
13 | 1310188b79 |
14 | 8c5b5a82d |
15 | 51b5cd7b4 |
hex | 30db7eca9 |
13115059369 has 2 divisors, whose sum is σ = 13115059370. Its totient is φ = 13115059368.
The previous prime is 13115059337. The next prime is 13115059409. The reversal of 13115059369 is 96395051131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9843219369 + 3271840000 = 99213^2 + 57200^2 .
It is an emirp because it is prime and its reverse (96395051131) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 13115059369 - 25 = 13115059337 is a prime.
It is a super-2 number, since 2×131150593692 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (13125059369) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6557529684 + 6557529685.
It is an arithmetic number, because the mean of its divisors is an integer number (6557529685).
Almost surely, 213115059369 is an apocalyptic number.
It is an amenable number.
13115059369 is a deficient number, since it is larger than the sum of its proper divisors (1).
13115059369 is an equidigital number, since it uses as much as digits as its factorization.
13115059369 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 109350, while the sum is 43.
The spelling of 13115059369 in words is "thirteen billion, one hundred fifteen million, fifty-nine thousand, three hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •