Base | Representation |
---|---|
bin | 11001100110111100100110… |
… | …01111000000001000000001 |
3 | 21101101112201121011121000001 |
4 | 30303132103033000020001 |
5 | 24340121113304320111 |
6 | 315434110224000001 |
7 | 14601352060350463 |
oct | 1463362317001001 |
9 | 241345647147001 |
10 | 56313786401281 |
11 | 16a415a7365102 |
12 | 6395ba5160001 |
13 | 25564a0b84666 |
14 | dc985d4d0133 |
15 | 679cb67961c1 |
hex | 3337933c0201 |
56313786401281 has 2 divisors, whose sum is σ = 56313786401282. Its totient is φ = 56313786401280.
The previous prime is 56313786401263. The next prime is 56313786401287. The reversal of 56313786401281 is 18210468731365.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 28562173120881 + 27751613280400 = 5344359^2 + 5267980^2 .
It is a cyclic number.
It is not a de Polignac number, because 56313786401281 - 213 = 56313786393089 is a prime.
It is a super-2 number, since 2×563137864012812 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (56313786401287) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 28156893200640 + 28156893200641.
It is an arithmetic number, because the mean of its divisors is an integer number (28156893200641).
Almost surely, 256313786401281 is an apocalyptic number.
It is an amenable number.
56313786401281 is a deficient number, since it is larger than the sum of its proper divisors (1).
56313786401281 is an equidigital number, since it uses as much as digits as its factorization.
56313786401281 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5806080, while the sum is 55.
The spelling of 56313786401281 in words is "fifty-six trillion, three hundred thirteen billion, seven hundred eighty-six million, four hundred one thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •