Base | Representation |
---|---|
bin | 110100001011000011… |
… | …011010111100101011 |
3 | 12100121010112220222220 |
4 | 310023003122330223 |
5 | 1404212111133120 |
6 | 41422451245123 |
7 | 4022141215326 |
oct | 641303327453 |
9 | 170533486886 |
10 | 56020021035 |
11 | 21837928a50 |
12 | aa34ba97a3 |
13 | 538a028654 |
14 | 29d60717bd |
15 | 16cd134b40 |
hex | d0b0daf2b |
56020021035 has 64 divisors (see below), whose sum is σ = 103866706944. Its totient is φ = 25480908800.
The previous prime is 56020021019. The next prime is 56020021133. The reversal of 56020021035 is 53012002065.
It is not a de Polignac number, because 56020021035 - 24 = 56020021019 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 56020020996 and 56020021014.
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 63 ways as a sum of consecutive naturals, for example, 840247 + ... + 904463.
It is an arithmetic number, because the mean of its divisors is an integer number (1622917296).
Almost surely, 256020021035 is an apocalyptic number.
56020021035 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
56020021035 is a deficient number, since it is larger than the sum of its proper divisors (47846685909).
56020021035 is a wasteful number, since it uses less digits than its factorization.
56020021035 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64564.
The product of its (nonzero) digits is 1800, while the sum is 24.
The spelling of 56020021035 in words is "fifty-six billion, twenty million, twenty-one thousand, thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •