Base | Representation |
---|---|
bin | 1101100000001… |
… | …1101000111011 |
3 | 10221120111202010 |
4 | 3120003220323 |
5 | 103444404021 |
6 | 5341541003 |
7 | 1255262253 |
oct | 330035073 |
9 | 127514663 |
10 | 56638011 |
11 | 29a74a81 |
12 | 16b74763 |
13 | b970921 |
14 | 7744963 |
15 | 4e8b976 |
hex | 3603a3b |
56638011 has 8 divisors (see below), whose sum is σ = 75713040. Its totient is φ = 37660832.
The previous prime is 56638007. The next prime is 56638013. The reversal of 56638011 is 11083665.
56638011 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 56638011 - 22 = 56638007 is a prime.
It is a super-2 number, since 2×566380112 = 6415728580072242, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 56638011.
It is not an unprimeable number, because it can be changed into a prime (56638013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 23100 + ... + 25433.
It is an arithmetic number, because the mean of its divisors is an integer number (9464130).
Almost surely, 256638011 is an apocalyptic number.
56638011 is a deficient number, since it is larger than the sum of its proper divisors (19075029).
56638011 is a wasteful number, since it uses less digits than its factorization.
56638011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48925.
The product of its (nonzero) digits is 4320, while the sum is 30.
The square root of 56638011 is about 7525.8229450340. The cubic root of 56638011 is about 384.0336952312.
The spelling of 56638011 in words is "fifty-six million, six hundred thirty-eight thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •