Base | Representation |
---|---|
bin | 101001100000010001101… |
… | …1001010111100000100101 |
3 | 202012022211012102121220101 |
4 | 1103000203121113200211 |
5 | 1221424411431442131 |
6 | 20044305105104101 |
7 | 1126060062365254 |
oct | 123004331274045 |
9 | 22168735377811 |
10 | 5704310421541 |
11 | 18aa203581706 |
12 | 78164a028031 |
13 | 324bb655c0a4 |
14 | 15a13932879b |
15 | 9d5aee1ac61 |
hex | 53023657825 |
5704310421541 has 2 divisors, whose sum is σ = 5704310421542. Its totient is φ = 5704310421540.
The previous prime is 5704310421457. The next prime is 5704310421587. The reversal of 5704310421541 is 1451240134075.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5678951133025 + 25359288516 = 2383055^2 + 159246^2 .
It is a cyclic number.
It is not a de Polignac number, because 5704310421541 - 27 = 5704310421413 is a prime.
It is a super-2 number, since 2×57043104215412 (a number of 26 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 5704310421541.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5704310424541) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2852155210770 + 2852155210771.
It is an arithmetic number, because the mean of its divisors is an integer number (2852155210771).
Almost surely, 25704310421541 is an apocalyptic number.
It is an amenable number.
5704310421541 is a deficient number, since it is larger than the sum of its proper divisors (1).
5704310421541 is an equidigital number, since it uses as much as digits as its factorization.
5704310421541 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 67200, while the sum is 37.
The spelling of 5704310421541 in words is "five trillion, seven hundred four billion, three hundred ten million, four hundred twenty-one thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •