Base | Representation |
---|---|
bin | 110100011010010101… |
… | …110010100100111101 |
3 | 12101021000011010122210 |
4 | 310122111302210331 |
5 | 1410223240312103 |
6 | 41504132331033 |
7 | 4031404211661 |
oct | 643225624475 |
9 | 171230133583 |
10 | 56276494653 |
11 | 21959683415 |
12 | aaa6a73a79 |
13 | 53cb1c67a2 |
14 | 2a1c1548a1 |
15 | 16e58e6e03 |
hex | d1a57293d |
56276494653 has 8 divisors (see below), whose sum is σ = 75058377408. Its totient is φ = 37506137504.
The previous prime is 56276494639. The next prime is 56276494667. The reversal of 56276494653 is 35649467265.
It is an interprime number because it is at equal distance from previous prime (56276494639) and next prime (56276494667).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 56276494653 - 210 = 56276493629 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 56276494593 and 56276494602.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56276494613) 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 in 7 ways as a sum of consecutive naturals, for example, 2870001 + ... + 2889542.
It is an arithmetic number, because the mean of its divisors is an integer number (9382297176).
Almost surely, 256276494653 is an apocalyptic number.
It is an amenable number.
56276494653 is a deficient number, since it is larger than the sum of its proper divisors (18781882755).
56276494653 is a wasteful number, since it uses less digits than its factorization.
56276494653 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5762803.
The product of its digits is 32659200, while the sum is 57.
The spelling of 56276494653 in words is "fifty-six billion, two hundred seventy-six million, four hundred ninety-four thousand, six hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •