Base | Representation |
---|---|
bin | 1101011101000… |
… | …1100110100100 |
3 | 10221012002121100 |
4 | 3113101212210 |
5 | 103421324220 |
6 | 5333320100 |
7 | 1253446605 |
oct | 327214644 |
9 | 127162540 |
10 | 56433060 |
11 | 29944aa2 |
12 | 16a96030 |
13 | b8cb558 |
14 | 76cddac |
15 | 4e4ad90 |
hex | 35d19a4 |
56433060 has 36 divisors (see below), whose sum is σ = 171180828. Its totient is φ = 15048768.
The previous prime is 56433037. The next prime is 56433061. The reversal of 56433060 is 6033465.
56433060 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 19927296 + 36505764 = 4464^2 + 6042^2 .
It is a tau number, because it is divible by the number of its divisors (36).
It is not an unprimeable number, because it can be changed into a prime (56433061) 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 11 ways as a sum of consecutive naturals, for example, 156579 + ... + 156938.
It is an arithmetic number, because the mean of its divisors is an integer number (4755023).
Almost surely, 256433060 is an apocalyptic number.
It is an amenable number.
56433060 is an abundant number, since it is smaller than the sum of its proper divisors (114747768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56433060 is a wasteful number, since it uses less digits than its factorization.
56433060 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 313532 (or 313527 counting only the distinct ones).
The product of its (nonzero) digits is 6480, while the sum is 27.
The square root of 56433060 is about 7512.1940869496. The cubic root of 56433060 is about 383.5699123533.
The spelling of 56433060 in words is "fifty-six million, four hundred thirty-three thousand, sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •