Base | Representation |
---|---|
bin | 11000110010101100… |
… | …10001100110100101 |
3 | 1021100121102202211221 |
4 | 30121112101212211 |
5 | 204224400442212 |
6 | 10040431100341 |
7 | 650560406614 |
oct | 143126214645 |
9 | 37317382757 |
10 | 13310171557 |
11 | 5710276991 |
12 | 26b56716b1 |
13 | 1341721477 |
14 | 903a2987b |
15 | 52d7be807 |
hex | 3195919a5 |
13310171557 has 4 divisors (see below), whose sum is σ = 13769143020. Its totient is φ = 12851200096.
The previous prime is 13310171551. The next prime is 13310171561. The reversal of 13310171557 is 75517101331.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 75517101331 = 7 ⋅10788157333.
It can be written as a sum of positive squares in 2 ways, for example, as 9470014596 + 3840156961 = 97314^2 + 61969^2 .
It is a cyclic number.
It is not a de Polignac number, because 13310171557 - 27 = 13310171429 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 (13310171551) 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, 229485688 + ... + 229485745.
It is an arithmetic number, because the mean of its divisors is an integer number (3442285755).
Almost surely, 213310171557 is an apocalyptic number.
It is an amenable number.
13310171557 is a deficient number, since it is larger than the sum of its proper divisors (458971463).
13310171557 is an equidigital number, since it uses as much as digits as its factorization.
13310171557 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 458971462.
The product of its (nonzero) digits is 11025, while the sum is 34.
Adding to 13310171557 its reverse (75517101331), we get a palindrome (88827272888).
The spelling of 13310171557 in words is "thirteen billion, three hundred ten million, one hundred seventy-one thousand, five hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •