Base | Representation |
---|---|
bin | 1101100100010… |
… | …1001010110101 |
3 | 10222002010221020 |
4 | 3121011022311 |
5 | 104032001141 |
6 | 5351411353 |
7 | 1260460635 |
oct | 331051265 |
9 | 128063836 |
10 | 56906421 |
11 | 2a138700 |
12 | 17083b59 |
13 | ba35b50 |
14 | 77b46c5 |
15 | 4ee1266 |
hex | 36452b5 |
56906421 has 48 divisors (see below), whose sum is σ = 92951040. Its totient is φ = 30729600.
The previous prime is 56906413. The next prime is 56906453. The reversal of 56906421 is 12460965.
56906421 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 56906421 - 23 = 56906413 is a prime.
It is a hoax number, since the sum of its digits (33) coincides with the sum of the digits of its distinct prime factors.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56906411) 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 47 ways as a sum of consecutive naturals, for example, 146095 + ... + 146483.
It is an arithmetic number, because the mean of its divisors is an integer number (1936480).
Almost surely, 256906421 is an apocalyptic number.
It is an amenable number.
56906421 is a deficient number, since it is larger than the sum of its proper divisors (36044619).
56906421 is a wasteful number, since it uses less digits than its factorization.
56906421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 458 (or 447 counting only the distinct ones).
The product of its (nonzero) digits is 12960, while the sum is 33.
The square root of 56906421 is about 7543.6344688751. The cubic root of 56906421 is about 384.6393902319.
The spelling of 56906421 in words is "fifty-six million, nine hundred six thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •