Base | Representation |
---|---|
bin | 1100011110001011101… |
… | …10001011001110010101 |
3 | 1111222002101000010111100 |
4 | 12033011312023032111 |
5 | 24010102343404410 |
6 | 524505421500313 |
7 | 42650103020640 |
oct | 6170566131625 |
9 | 1458071003440 |
10 | 428521075605 |
11 | 155809a80667 |
12 | 6b072a11699 |
13 | 315424b003c |
14 | 16a52032a57 |
15 | b23078c8c0 |
hex | 63c5d8b395 |
428521075605 has 24 divisors (see below), whose sum is σ = 848879845632. Its totient is φ = 195895348704.
The previous prime is 428521075537. The next prime is 428521075643. The reversal of 428521075605 is 506570125824.
428521075605 is a `hidden beast` number, since 4 + 2 + 85 + 2 + 1 + 0 + 7 + 560 + 5 = 666.
It is not a de Polignac number, because 428521075605 - 211 = 428521073557 is a prime.
It is a super-2 number, since 2×4285210756052 (a number of 24 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 680191869 + ... + 680192498.
It is an arithmetic number, because the mean of its divisors is an integer number (35369993568).
Almost surely, 2428521075605 is an apocalyptic number.
428521075605 is a gapful number since it is divisible by the number (45) formed by its first and last digit.
It is an amenable number.
428521075605 is a deficient number, since it is larger than the sum of its proper divisors (420358770027).
428521075605 is a wasteful number, since it uses less digits than its factorization.
428521075605 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1360384385 (or 1360384382 counting only the distinct ones).
The product of its (nonzero) digits is 672000, while the sum is 45.
The spelling of 428521075605 in words is "four hundred twenty-eight billion, five hundred twenty-one million, seventy-five thousand, six hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •