Base | Representation |
---|---|
bin | 11010000001011000110001… |
… | …00110111000011011100001 |
3 | 21111121101122211112022210201 |
4 | 31000230120212320123201 |
5 | 30000012143101133101 |
6 | 321411313323425201 |
7 | 15024112666550524 |
oct | 1500543046703341 |
9 | 244541584468721 |
10 | 57222262130401 |
11 | 17261909211705 |
12 | 6502083985201 |
13 | 25c10615bb5a4 |
14 | 101b802418bbb |
15 | 693737e3ee01 |
hex | 340b189b86e1 |
57222262130401 has 2 divisors, whose sum is σ = 57222262130402. Its totient is φ = 57222262130400.
The previous prime is 57222262130357. The next prime is 57222262130413. The reversal of 57222262130401 is 10403126222275.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 56964831725025 + 257430405376 = 7547505^2 + 507376^2 .
It is a cyclic number.
It is not a de Polignac number, because 57222262130401 - 219 = 57222261606113 is a prime.
It is a super-2 number, since 2×572222621304012 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (57222262130441) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 28611131065200 + 28611131065201.
It is an arithmetic number, because the mean of its divisors is an integer number (28611131065201).
Almost surely, 257222262130401 is an apocalyptic number.
It is an amenable number.
57222262130401 is a deficient number, since it is larger than the sum of its proper divisors (1).
57222262130401 is an equidigital number, since it uses as much as digits as its factorization.
57222262130401 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 80640, while the sum is 37.
Adding to 57222262130401 its reverse (10403126222275), we get a palindrome (67625388352676).
The spelling of 57222262130401 in words is "fifty-seven trillion, two hundred twenty-two billion, two hundred sixty-two million, one hundred thirty thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •