Base | Representation |
---|---|
bin | 11001100010110… |
… | …111011100110101 |
3 | 1002212102122002120 |
4 | 121202313130311 |
5 | 1334203223141 |
6 | 110305430153 |
7 | 13422534306 |
oct | 3142673465 |
9 | 1085378076 |
10 | 428570421 |
11 | 1aaa0a334 |
12 | bb63b359 |
13 | 6aa35986 |
14 | 40cc07ad |
15 | 27958c66 |
hex | 198b7735 |
428570421 has 8 divisors (see below), whose sum is σ = 572121504. Its totient is φ = 285366480.
The previous prime is 428570419. The next prime is 428570423. The reversal of 428570421 is 124075824.
It is an interprime number because it is at equal distance from previous prime (428570419) and next prime (428570423).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 428570421 - 21 = 428570419 is a prime.
It is a super-2 number, since 2×4285704212 = 367345211512234482, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (428570423) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 83890 + ... + 88851.
It is an arithmetic number, because the mean of its divisors is an integer number (71515188).
Almost surely, 2428570421 is an apocalyptic number.
It is an amenable number.
428570421 is a deficient number, since it is larger than the sum of its proper divisors (143551083).
428570421 is a wasteful number, since it uses less digits than its factorization.
428570421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 173571.
The product of its (nonzero) digits is 17920, while the sum is 33.
The square root of 428570421 is about 20701.9424450944. The cubic root of 428570421 is about 753.9468502852.
The spelling of 428570421 in words is "four hundred twenty-eight million, five hundred seventy thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •