Base | Representation |
---|---|
bin | 110100011011111100… |
… | …111110111011000011 |
3 | 12101022220001111012102 |
4 | 310123330332323003 |
5 | 1410302201433201 |
6 | 41510540221015 |
7 | 4032153150014 |
oct | 643374767303 |
9 | 171286044172 |
10 | 56303546051 |
11 | 2197297a545 |
12 | aab3b3a76b |
13 | 54039a862c |
14 | 2a2199700b |
15 | 16e7e8c26b |
hex | d1bf3eec3 |
56303546051 has 32 divisors (see below), whose sum is σ = 61613260800. Its totient is φ = 51254532000.
The previous prime is 56303546041. The next prime is 56303546071. The reversal of 56303546051 is 15064530365.
It is a de Polignac number, because none of the positive numbers 2k-56303546051 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 56303545996 and 56303546014.
It is not an unprimeable number, because it can be changed into a prime (56303546041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 69424436 + ... + 69425246.
It is an arithmetic number, because the mean of its divisors is an integer number (1925414400).
Almost surely, 256303546051 is an apocalyptic number.
56303546051 is a deficient number, since it is larger than the sum of its proper divisors (5309714749).
56303546051 is a wasteful number, since it uses less digits than its factorization.
56303546051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1551.
The product of its (nonzero) digits is 162000, while the sum is 38.
The spelling of 56303546051 in words is "fifty-six billion, three hundred three million, five hundred forty-six thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •