Base | Representation |
---|---|
bin | 1010111011111000… |
… | …01100000111010001 |
3 | 120011011101001111011 |
4 | 11131330030013101 |
5 | 44010440323031 |
6 | 2410324250521 |
7 | 265326621514 |
oct | 53574140721 |
9 | 16134331434 |
10 | 5871026641 |
11 | 2543050237 |
12 | 117a240a41 |
13 | 72744c67c |
14 | 3d9a38d7b |
15 | 24565d6b1 |
hex | 15df0c1d1 |
5871026641 has 2 divisors, whose sum is σ = 5871026642. Its totient is φ = 5871026640.
The previous prime is 5871026639. The next prime is 5871026669. The reversal of 5871026641 is 1466201785.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5390496400 + 480530241 = 73420^2 + 21921^2 .
It is a cyclic number.
It is not a de Polignac number, because 5871026641 - 21 = 5871026639 is a prime.
Together with 5871026639, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 5871026594 and 5871026603.
It is not a weakly prime, because it can be changed into another prime (5871026671) 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, 2935513320 + 2935513321.
It is an arithmetic number, because the mean of its divisors is an integer number (2935513321).
Almost surely, 25871026641 is an apocalyptic number.
It is an amenable number.
5871026641 is a deficient number, since it is larger than the sum of its proper divisors (1).
5871026641 is an equidigital number, since it uses as much as digits as its factorization.
5871026641 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 80640, while the sum is 40.
The square root of 5871026641 is about 76622.6248636785. The cubic root of 5871026641 is about 1804.0061636040.
The spelling of 5871026641 in words is "five billion, eight hundred seventy-one million, twenty-six thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.111 sec. • engine limits •