Base | Representation |
---|---|
bin | 110100011100100100… |
… | …101011100001001101 |
3 | 12101100121122011221021 |
4 | 310130210223201031 |
5 | 1410312332433313 |
6 | 41511551234141 |
7 | 4032340461022 |
oct | 643444534115 |
9 | 171317564837 |
10 | 56313952333 |
11 | 21978837981 |
12 | aab7518951 |
13 | 5405bb00b2 |
14 | 2a23105549 |
15 | 16e8d4578d |
hex | d1c92b84d |
56313952333 has 2 divisors, whose sum is σ = 56313952334. Its totient is φ = 56313952332.
The previous prime is 56313952301. The next prime is 56313952337. The reversal of 56313952333 is 33325931365.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 50781270409 + 5532681924 = 225347^2 + 74382^2 .
It is a cyclic number.
It is not a de Polignac number, because 56313952333 - 25 = 56313952301 is a prime.
It is a super-2 number, since 2×563139523332 (a number of 22 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 56313952333.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (56313952337) 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, 28156976166 + 28156976167.
It is an arithmetic number, because the mean of its divisors is an integer number (28156976167).
Almost surely, 256313952333 is an apocalyptic number.
It is an amenable number.
56313952333 is a deficient number, since it is larger than the sum of its proper divisors (1).
56313952333 is an equidigital number, since it uses as much as digits as its factorization.
56313952333 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 656100, while the sum is 43.
The spelling of 56313952333 in words is "fifty-six billion, three hundred thirteen million, nine hundred fifty-two thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •