Base | Representation |
---|---|
bin | 110100100011100001… |
… | …111000101111000110 |
3 | 12101122202020120111211 |
4 | 310203201320233012 |
5 | 1411032222114200 |
6 | 41531320522034 |
7 | 4035255462145 |
oct | 644341705706 |
9 | 171582216454 |
10 | 56430660550 |
11 | 21a28700550 |
12 | ab2a62031a |
13 | 5424123904 |
14 | 2a3480575c |
15 | 17041eaaba |
hex | d23878bc6 |
56430660550 has 24 divisors (see below), whose sum is σ = 114502941432. Its totient is φ = 20520240000.
The previous prime is 56430660547. The next prime is 56430660553. The reversal of 56430660550 is 5506603465.
It is a happy number.
56430660550 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (56430660547) and next prime (56430660553).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56430660553) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 51300051 + ... + 51301150.
It is an arithmetic number, because the mean of its divisors is an integer number (4770955893).
Almost surely, 256430660550 is an apocalyptic number.
56430660550 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
56430660550 is an abundant number, since it is smaller than the sum of its proper divisors (58072280882).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56430660550 is a wasteful number, since it uses less digits than its factorization.
56430660550 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 102601224 (or 102601219 counting only the distinct ones).
The product of its (nonzero) digits is 324000, while the sum is 40.
The spelling of 56430660550 in words is "fifty-six billion, four hundred thirty million, six hundred sixty thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •