Base | Representation |
---|---|
bin | 110100011001101011… |
… | …011101111110101101 |
3 | 12101020020021110222111 |
4 | 310121223131332231 |
5 | 1410212420301422 |
6 | 41503054444021 |
7 | 4031211003514 |
oct | 643153357655 |
9 | 171206243874 |
10 | 56265400237 |
11 | 21953395a82 |
12 | aaa3203611 |
13 | 53c8b10a47 |
14 | 2a1a8a767b |
15 | 16e4954a77 |
hex | d19addfad |
56265400237 has 2 divisors, whose sum is σ = 56265400238. Its totient is φ = 56265400236.
The previous prime is 56265400223. The next prime is 56265400267. The reversal of 56265400237 is 73200456265.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 42546900361 + 13718499876 = 206269^2 + 117126^2 .
It is a cyclic number.
It is not a de Polignac number, because 56265400237 - 27 = 56265400109 is a prime.
It is a super-3 number, since 3×562654002373 (a number of 33 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 56265400237.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (56265400267) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 28132700118 + 28132700119.
It is an arithmetic number, because the mean of its divisors is an integer number (28132700119).
Almost surely, 256265400237 is an apocalyptic number.
It is an amenable number.
56265400237 is a deficient number, since it is larger than the sum of its proper divisors (1).
56265400237 is an equidigital number, since it uses as much as digits as its factorization.
56265400237 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 302400, while the sum is 40.
The spelling of 56265400237 in words is "fifty-six billion, two hundred sixty-five million, four hundred thousand, two hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.227 sec. • engine limits •