Base | Representation |
---|---|
bin | 11001001110001000… |
… | …01010100001110101 |
3 | 1021221122110202121021 |
4 | 30213010022201311 |
5 | 210212304230023 |
6 | 10115331421141 |
7 | 656353456624 |
oct | 144704124165 |
9 | 37848422537 |
10 | 13540305013 |
11 | 5819170624 |
12 | 275a7547b1 |
13 | 137a2c9401 |
14 | 9264136bb |
15 | 543acc35d |
hex | 32710a875 |
13540305013 has 4 divisors (see below), whose sum is σ = 13562251020. Its totient is φ = 13518359008.
The previous prime is 13540305011. The next prime is 13540305019. The reversal of 13540305013 is 31050304531.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 31050304531 = 22483 ⋅1381057.
It can be written as a sum of positive squares in 2 ways, for example, as 4279514724 + 9260790289 = 65418^2 + 96233^2 .
It is a cyclic number.
It is not a de Polignac number, because 13540305013 - 21 = 13540305011 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13540305011) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10972078 + ... + 10973311.
It is an arithmetic number, because the mean of its divisors is an integer number (3390562755).
Almost surely, 213540305013 is an apocalyptic number.
It is an amenable number.
13540305013 is a deficient number, since it is larger than the sum of its proper divisors (21946007).
13540305013 is an equidigital number, since it uses as much as digits as its factorization.
13540305013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21946006.
The product of its (nonzero) digits is 2700, while the sum is 25.
Adding to 13540305013 its reverse (31050304531), we get a palindrome (44590609544).
The spelling of 13540305013 in words is "thirteen billion, five hundred forty million, three hundred five thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •