Base | Representation |
---|---|
bin | 11000011111101010… |
… | …00001101010110101 |
3 | 1020221110220121121012 |
4 | 30033311001222311 |
5 | 203413004214342 |
6 | 10012524002005 |
7 | 643611033161 |
oct | 141765015265 |
9 | 36843817535 |
10 | 13150460597 |
11 | 563910175a |
12 | 2670090305 |
13 | 1317602441 |
14 | 8ca733ca1 |
15 | 51e772b82 |
hex | 30fd41ab5 |
13150460597 has 2 divisors, whose sum is σ = 13150460598. Its totient is φ = 13150460596.
The previous prime is 13150460573. The next prime is 13150460629. The reversal of 13150460597 is 79506405131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12750700561 + 399760036 = 112919^2 + 19994^2 .
It is a cyclic number.
It is not a de Polignac number, because 13150460597 - 28 = 13150460341 is a prime.
It is a super-2 number, since 2×131504605972 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13150460527) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6575230298 + 6575230299.
It is an arithmetic number, because the mean of its divisors is an integer number (6575230299).
Almost surely, 213150460597 is an apocalyptic number.
It is an amenable number.
13150460597 is a deficient number, since it is larger than the sum of its proper divisors (1).
13150460597 is an equidigital number, since it uses as much as digits as its factorization.
13150460597 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 113400, while the sum is 41.
The spelling of 13150460597 in words is "thirteen billion, one hundred fifty million, four hundred sixty thousand, five hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •