Base | Representation |
---|---|
bin | 11001001010111001… |
… | …00101011000000101 |
3 | 1021212202101020200022 |
4 | 30211130211120011 |
5 | 210133331331010 |
6 | 10112521424525 |
7 | 655603616423 |
oct | 144534453005 |
9 | 37782336608 |
10 | 13513152005 |
11 | 5804905121 |
12 | 275163b145 |
13 | 13747b0242 |
14 | 922986113 |
15 | 541516d55 |
hex | 325725605 |
13513152005 has 4 divisors (see below), whose sum is σ = 16215782412. Its totient is φ = 10810521600.
The previous prime is 13513151969. The next prime is 13513152047. The reversal of 13513152005 is 50025131531.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 50025131531 = 6659 ⋅7512409.
It can be written as a sum of positive squares in 2 ways, for example, as 2519839204 + 10993312801 = 50198^2 + 104849^2 .
It is not a de Polignac number, because 13513152005 - 214 = 13513135621 is a prime.
It is a super-2 number, since 2×135131520052 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1351315196 + ... + 1351315205.
It is an arithmetic number, because the mean of its divisors is an integer number (4053945603).
Almost surely, 213513152005 is an apocalyptic number.
It is an amenable number.
13513152005 is a deficient number, since it is larger than the sum of its proper divisors (2702630407).
13513152005 is an equidigital number, since it uses as much as digits as its factorization.
13513152005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2702630406.
The product of its (nonzero) digits is 2250, while the sum is 26.
Adding to 13513152005 its reverse (50025131531), we get a palindrome (63538283536).
The spelling of 13513152005 in words is "thirteen billion, five hundred thirteen million, one hundred fifty-two thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •