Base | Representation |
---|---|
bin | 110100101010011011… |
… | …000101111010110010 |
3 | 12101221210212200112000 |
4 | 310222123011322302 |
5 | 1411301324220200 |
6 | 41551011514430 |
7 | 4041161534643 |
oct | 645233057262 |
9 | 171853780460 |
10 | 56546320050 |
11 | 21a87a18210 |
12 | ab612b8a16 |
13 | 544208ac9c |
14 | 2a45d116ca |
15 | 170e445300 |
hex | d2a6c5eb2 |
56546320050 has 96 divisors (see below), whose sum is σ = 169981709760. Its totient is φ = 13708195200.
The previous prime is 56546320049. The next prime is 56546320063. The reversal of 56546320050 is 5002364565.
It is a happy number.
56546320050 is a `hidden beast` number, since 565 + 46 + 3 + 2 + 0 + 0 + 50 = 666.
It is a super-2 number, since 2×565463200502 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 56546319987 and 56546320014.
It is an unprimeable number.
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, 1889067 + ... + 1918766.
It is an arithmetic number, because the mean of its divisors is an integer number (1770642810).
Almost surely, 256546320050 is an apocalyptic number.
56546320050 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
56546320050 is an abundant number, since it is smaller than the sum of its proper divisors (113435389710).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56546320050 is a wasteful number, since it uses less digits than its factorization.
56546320050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3807865 (or 3807854 counting only the distinct ones).
The product of its (nonzero) digits is 108000, while the sum is 36.
The spelling of 56546320050 in words is "fifty-six billion, five hundred forty-six million, three hundred twenty thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •