Base | Representation |
---|---|
bin | 1100000011110110… |
… | …10010101011010101 |
3 | 121201020102110021011 |
4 | 12001323102223111 |
5 | 101230020134112 |
6 | 2550252452221 |
7 | 316310434561 |
oct | 60173225325 |
9 | 17636373234 |
10 | 6474771157 |
11 | 2822926448 |
12 | 130847a071 |
13 | 7c255974a |
14 | 455cb86a1 |
15 | 27d66aaa7 |
hex | 181ed2ad5 |
6474771157 has 2 divisors, whose sum is σ = 6474771158. Its totient is φ = 6474771156.
The previous prime is 6474771131. The next prime is 6474771161. The reversal of 6474771157 is 7511774746.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6072929041 + 401842116 = 77929^2 + 20046^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-6474771157 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 6474771157.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (6474771257) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3237385578 + 3237385579.
It is an arithmetic number, because the mean of its divisors is an integer number (3237385579).
Almost surely, 26474771157 is an apocalyptic number.
It is an amenable number.
6474771157 is a deficient number, since it is larger than the sum of its proper divisors (1).
6474771157 is an equidigital number, since it uses as much as digits as its factorization.
6474771157 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1152480, while the sum is 49.
The square root of 6474771157 is about 80465.9627233776. The cubic root of 6474771157 is about 1863.8379108880.
The spelling of 6474771157 in words is "six billion, four hundred seventy-four million, seven hundred seventy-one thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •