Base | Representation |
---|---|
bin | 110100111100010011… |
… | …001000110101110001 |
3 | 12102201201012102102121 |
4 | 310330103020311301 |
5 | 1412410113143003 |
6 | 42040443514241 |
7 | 4051462636453 |
oct | 647423106561 |
9 | 172651172377 |
10 | 56846224753 |
11 | 2212123703a |
12 | b025828981 |
13 | 548c2545a6 |
14 | 2a73a9c2d3 |
15 | 172a935cbd |
hex | d3c4c8d71 |
56846224753 has 2 divisors, whose sum is σ = 56846224754. Its totient is φ = 56846224752.
The previous prime is 56846224727. The next prime is 56846224769. The reversal of 56846224753 is 35742264865.
56846224753 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 50704681329 + 6141543424 = 225177^2 + 78368^2 .
It is a cyclic number.
It is not a de Polignac number, because 56846224753 - 213 = 56846216561 is a prime.
It is a super-2 number, since 2×568462247532 (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 56846224753.
It is not a weakly prime, because it can be changed into another prime (56846224153) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 28423112376 + 28423112377.
It is an arithmetic number, because the mean of its divisors is an integer number (28423112377).
Almost surely, 256846224753 is an apocalyptic number.
It is an amenable number.
56846224753 is a deficient number, since it is larger than the sum of its proper divisors (1).
56846224753 is an equidigital number, since it uses as much as digits as its factorization.
56846224753 is an evil number, because the sum of its binary digits is even.
The product of its digits is 9676800, while the sum is 52.
The spelling of 56846224753 in words is "fifty-six billion, eight hundred forty-six million, two hundred twenty-four thousand, seven hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •