Base | Representation |
---|---|
bin | 110100100011101101… |
… | …001110100010111001 |
3 | 12101122221211121120210 |
4 | 310203231032202321 |
5 | 1411034002232330 |
6 | 41531504341333 |
7 | 4035322653426 |
oct | 644355164271 |
9 | 171587747523 |
10 | 56433633465 |
11 | 21a2a351100 |
12 | ab2b614849 |
13 | 5424924b31 |
14 | 2a34d7ad4d |
15 | 17045d68b0 |
hex | d23b4e8b9 |
56433633465 has 48 divisors (see below), whose sum is σ = 104472244800. Its totient is φ = 25921653120.
The previous prime is 56433633463. The next prime is 56433633467.
It is a happy number.
56433633465 is nontrivially palindromic in base 10.
It is an interprime number because it is at equal distance from previous prime (56433633463) and next prime (56433633467).
It is not a de Polignac number, because 56433633465 - 21 = 56433633463 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (56433633463) 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 47 ways as a sum of consecutive naturals, for example, 783750 + ... + 852719.
It is an arithmetic number, because the mean of its divisors is an integer number (2176505100).
Almost surely, 256433633465 is an apocalyptic number.
56433633465 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
56433633465 is a deficient number, since it is larger than the sum of its proper divisors (48038611335).
56433633465 is a wasteful number, since it uses less digits than its factorization.
56433633465 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1636518 (or 1636507 counting only the distinct ones).
The product of its digits is 6998400, while the sum is 48.
The spelling of 56433633465 in words is "fifty-six billion, four hundred thirty-three million, six hundred thirty-three thousand, four hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •