Base | Representation |
---|---|
bin | 110100101010010111… |
… | …011100010011001110 |
3 | 12101221202002001220021 |
4 | 310222113130103032 |
5 | 1411301103110100 |
6 | 41550535212354 |
7 | 4041150441103 |
oct | 645227342316 |
9 | 171852061807 |
10 | 56545363150 |
11 | 21a87424291 |
12 | ab60b170ba |
13 | 5441b14583 |
14 | 2a45b42aaa |
15 | 170e306a1a |
hex | d2a5dc4ce |
56545363150 has 24 divisors (see below), whose sum is σ = 109747176624. Its totient is φ = 21634747200.
The previous prime is 56545363141. The next prime is 56545363157. The reversal of 56545363150 is 5136354565.
It is a junction number, because it is equal to n+sod(n) for n = 56545363097 and 56545363106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56545363157) 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 11 ways as a sum of consecutive naturals, for example, 24583791 + ... + 24586090.
It is an arithmetic number, because the mean of its divisors is an integer number (4572799026).
Almost surely, 256545363150 is an apocalyptic number.
56545363150 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
56545363150 is a deficient number, since it is larger than the sum of its proper divisors (53201813474).
56545363150 is a wasteful number, since it uses less digits than its factorization.
56545363150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49169916 (or 49169911 counting only the distinct ones).
The product of its (nonzero) digits is 810000, while the sum is 43.
The spelling of 56545363150 in words is "fifty-six billion, five hundred forty-five million, three hundred sixty-three thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •