Base | Representation |
---|---|
bin | 10010011101110011… |
… | …11011000100011101 |
3 | 221120220110020211201 |
4 | 21032321323010131 |
5 | 130300404212342 |
6 | 4315421515501 |
7 | 500446261504 |
oct | 111671730435 |
9 | 27526406751 |
10 | 9913741597 |
11 | 4228059881 |
12 | 1b08112b91 |
13 | c1cb785b6 |
14 | 6a090b83b |
15 | 3d051edb7 |
hex | 24ee7b11d |
9913741597 has 2 divisors, whose sum is σ = 9913741598. Its totient is φ = 9913741596.
The previous prime is 9913741577. The next prime is 9913741613. The reversal of 9913741597 is 7951473199.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7024786596 + 2888955001 = 83814^2 + 53749^2 .
It is a cyclic number.
It is not a de Polignac number, because 9913741597 - 231 = 7766257949 is a prime.
It is a super-2 number, since 2×99137415972 (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 (9913741577) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 4956870798 + 4956870799.
It is an arithmetic number, because the mean of its divisors is an integer number (4956870799).
Almost surely, 29913741597 is an apocalyptic number.
It is an amenable number.
9913741597 is a deficient number, since it is larger than the sum of its proper divisors (1).
9913741597 is an equidigital number, since it uses as much as digits as its factorization.
9913741597 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2143260, while the sum is 55.
The square root of 9913741597 is about 99567.7738879403. The cubic root of 9913741597 is about 2148.2221897739. Note that the first 3 decimals are identical.
The spelling of 9913741597 in words is "nine billion, nine hundred thirteen million, seven hundred forty-one thousand, five hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •