Base | Representation |
---|---|
bin | 11001100000101… |
… | …111111001100101 |
3 | 1002211101102111000 |
4 | 121200233321211 |
5 | 1334032441310 |
6 | 110245503513 |
7 | 13415032512 |
oct | 3140577145 |
9 | 1084342430 |
10 | 428015205 |
11 | 1aa670182 |
12 | bb411b99 |
13 | 6a8a0047 |
14 | 40bb8309 |
15 | 278994c0 |
hex | 1982fe65 |
428015205 has 128 divisors (see below), whose sum is σ = 855360000. Its totient is φ = 202051584.
The previous prime is 428015201. The next prime is 428015219. The reversal of 428015205 is 502510824.
It is a happy number.
It is not a de Polignac number, because 428015205 - 22 = 428015201 is a prime.
It is a super-3 number, since 3×4280152053 (a number of 27 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (428015201) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 3926691 + ... + 3926799.
It is an arithmetic number, because the mean of its divisors is an integer number (6682500).
Almost surely, 2428015205 is an apocalyptic number.
428015205 is a gapful number since it is divisible by the number (45) formed by its first and last digit.
It is an amenable number.
428015205 is a deficient number, since it is larger than the sum of its proper divisors (427344795).
428015205 is a wasteful number, since it uses less digits than its factorization.
428015205 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 228 (or 222 counting only the distinct ones).
The product of its (nonzero) digits is 3200, while the sum is 27.
The square root of 428015205 is about 20688.5283430214. The cubic root of 428015205 is about 753.6211284342.
The spelling of 428015205 in words is "four hundred twenty-eight million, fifteen thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •