Base | Representation |
---|---|
bin | 1010000011011000… |
… | …10100111000000101 |
3 | 111221010121101211112 |
4 | 11001230110320011 |
5 | 42023124344211 |
6 | 2251314414405 |
7 | 250513434305 |
oct | 50154247005 |
9 | 14833541745 |
10 | 5397106181 |
11 | 231a586835 |
12 | 1067591405 |
13 | 6801c8c6c |
14 | 392b11605 |
15 | 218c4788b |
hex | 141b14e05 |
5397106181 has 2 divisors, whose sum is σ = 5397106182. Its totient is φ = 5397106180.
The previous prime is 5397106159. The next prime is 5397106259. The reversal of 5397106181 is 1816017935.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4417729156 + 979377025 = 66466^2 + 31295^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5397106181 is a prime.
It is a super-2 number, since 2×53971061812 = 58257510257976809522, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5397106151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2698553090 + 2698553091.
It is an arithmetic number, because the mean of its divisors is an integer number (2698553091).
Almost surely, 25397106181 is an apocalyptic number.
It is an amenable number.
5397106181 is a deficient number, since it is larger than the sum of its proper divisors (1).
5397106181 is an equidigital number, since it uses as much as digits as its factorization.
5397106181 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 45360, while the sum is 41.
The square root of 5397106181 is about 73464.9997005377. Note that the first 3 decimals coincide. The cubic root of 5397106181 is about 1754.0971951486.
The spelling of 5397106181 in words is "five billion, three hundred ninety-seven million, one hundred six thousand, one hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •