Base | Representation |
---|---|
bin | 101001100000100111000… |
… | …0101100100100100011001 |
3 | 202012101200010010220222202 |
4 | 1103001032011210210121 |
5 | 1221432343310334231 |
6 | 20044504132255545 |
7 | 1126113610300064 |
oct | 123011605444431 |
9 | 22171603126882 |
10 | 5705026652441 |
11 | 18aa5408a7576 |
12 | 781809a715b5 |
13 | 324c9ba6215c |
14 | 15a1a64c98db |
15 | 9d602c475cb |
hex | 5304e164919 |
5705026652441 has 2 divisors, whose sum is σ = 5705026652442. Its totient is φ = 5705026652440.
The previous prime is 5705026652341. The next prime is 5705026652453. The reversal of 5705026652441 is 1442566205075.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4205452518400 + 1499574134041 = 2050720^2 + 1224571^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5705026652441 is a prime.
It is a super-2 number, since 2×57050266524412 (a number of 26 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (5705026652471) 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, 2852513326220 + 2852513326221.
It is an arithmetic number, because the mean of its divisors is an integer number (2852513326221).
Almost surely, 25705026652441 is an apocalyptic number.
It is an amenable number.
5705026652441 is a deficient number, since it is larger than the sum of its proper divisors (1).
5705026652441 is an equidigital number, since it uses as much as digits as its factorization.
5705026652441 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2016000, while the sum is 47.
The spelling of 5705026652441 in words is "five trillion, seven hundred five billion, twenty-six million, six hundred fifty-two thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •