Base | Representation |
---|---|
bin | 100100011000110100100… |
… | …0111111000000110000101 |
3 | 122201002201122111200100102 |
4 | 1020301221013320012011 |
5 | 1123414231013324442 |
6 | 14345250505253445 |
7 | 1024214026151255 |
oct | 110615107700605 |
9 | 18632648450312 |
10 | 5001105604997 |
11 | 1658a5880a9a7 |
12 | 6892b8194285 |
13 | 2a37aa1581c8 |
14 | 1340aa543965 |
15 | 8a154813232 |
hex | 48c691f8185 |
5001105604997 has 2 divisors, whose sum is σ = 5001105604998. Its totient is φ = 5001105604996.
The previous prime is 5001105604927. The next prime is 5001105605009. The reversal of 5001105604997 is 7994065011005.
5001105604997 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3286265593636 + 1714840011361 = 1812806^2 + 1309519^2 .
It is a cyclic number.
It is not a de Polignac number, because 5001105604997 - 222 = 5001101410693 is a prime.
It is a super-2 number, since 2×50011056049972 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5001105604927) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2500552802498 + 2500552802499.
It is an arithmetic number, because the mean of its divisors is an integer number (2500552802499).
Almost surely, 25001105604997 is an apocalyptic number.
It is an amenable number.
5001105604997 is a deficient number, since it is larger than the sum of its proper divisors (1).
5001105604997 is an equidigital number, since it uses as much as digits as its factorization.
5001105604997 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 340200, while the sum is 47.
The spelling of 5001105604997 in words is "five trillion, one billion, one hundred five million, six hundred four thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •