Base | Representation |
---|---|
bin | 1101010111011… |
… | …1010100100000 |
3 | 10220111022100012 |
4 | 3111313110200 |
5 | 103323011024 |
6 | 5321344052 |
7 | 1250346515 |
oct | 325672440 |
9 | 126438305 |
10 | 56063264 |
11 | 29712184 |
12 | 16938028 |
13 | b7cc13a |
14 | 763530c |
15 | 4dc650e |
hex | 3577520 |
56063264 has 24 divisors (see below), whose sum is σ = 114182460. Its totient is φ = 27064576.
The previous prime is 56063257. The next prime is 56063269. The reversal of 56063264 is 46236065.
56063264 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 53173264 + 2890000 = 7292^2 + 1700^2 .
It is a Harshad number since it is a multiple of its sum of digits (32).
It is a self number, because there is not a number n which added to its sum of digits gives 56063264.
It is not an unprimeable number, because it can be changed into a prime (56063269) 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 3 ways as a sum of consecutive naturals, for example, 29279 + ... + 31134.
Almost surely, 256063264 is an apocalyptic number.
It is an amenable number.
56063264 is an abundant number, since it is smaller than the sum of its proper divisors (58119196).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56063264 is a wasteful number, since it uses less digits than its factorization.
56063264 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 60452 (or 60444 counting only the distinct ones).
The product of its (nonzero) digits is 25920, while the sum is 32.
The square root of 56063264 is about 7487.5405841972. The cubic root of 56063264 is about 382.7302533811.
The spelling of 56063264 in words is "fifty-six million, sixty-three thousand, two hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •