Base | Representation |
---|---|
bin | 100100110011001001101… |
… | …0000110010000011011111 |
3 | 122220111200010102010222112 |
4 | 1021212103100302003133 |
5 | 1130331030133014341 |
6 | 14431241231104235 |
7 | 1031255132341466 |
oct | 111462320620337 |
9 | 18814603363875 |
10 | 5057647157471 |
11 | 167aa32a71167 |
12 | 69825797207b |
13 | 2a8c1b23712c |
14 | 136b119739dd |
15 | 8b863615aeb |
hex | 499934320df |
5057647157471 has 2 divisors, whose sum is σ = 5057647157472. Its totient is φ = 5057647157470.
The previous prime is 5057647157467. The next prime is 5057647157473. The reversal of 5057647157471 is 1747517467505.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 5057647157471 - 22 = 5057647157467 is a prime.
It is a super-3 number, since 3×50576471574713 (a number of 39 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Sophie Germain prime.
Together with 5057647157473, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 5057647157471.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5057647157473) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2528823578735 + 2528823578736.
It is an arithmetic number, because the mean of its divisors is an integer number (2528823578736).
Almost surely, 25057647157471 is an apocalyptic number.
5057647157471 is a deficient number, since it is larger than the sum of its proper divisors (1).
5057647157471 is an equidigital number, since it uses as much as digits as its factorization.
5057647157471 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 28812000, while the sum is 59.
The spelling of 5057647157471 in words is "five trillion, fifty-seven billion, six hundred forty-seven million, one hundred fifty-seven thousand, four hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •