Base | Representation |
---|---|
bin | 11000011011011011… |
… | …11110110100011001 |
3 | 1020212000022001101202 |
4 | 30031231332310121 |
5 | 203324423400411 |
6 | 10005221123545 |
7 | 643001111006 |
oct | 141555766431 |
9 | 36760261352 |
10 | 13115059481 |
11 | 5620122337 |
12 | 26602595b5 |
13 | 1310188c34 |
14 | 8c5b5a8ad |
15 | 51b5cd83b |
hex | 30db7ed19 |
13115059481 has 2 divisors, whose sum is σ = 13115059482. Its totient is φ = 13115059480.
The previous prime is 13115059427. The next prime is 13115059501. The reversal of 13115059481 is 18495051131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7451142400 + 5663917081 = 86320^2 + 75259^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13115059481 is a prime.
It is a super-2 number, since 2×131150594812 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (13115059421) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6557529740 + 6557529741.
It is an arithmetic number, because the mean of its divisors is an integer number (6557529741).
Almost surely, 213115059481 is an apocalyptic number.
It is an amenable number.
13115059481 is a deficient number, since it is larger than the sum of its proper divisors (1).
13115059481 is an equidigital number, since it uses as much as digits as its factorization.
13115059481 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 21600, while the sum is 38.
The spelling of 13115059481 in words is "thirteen billion, one hundred fifteen million, fifty-nine thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •