Base | Representation |
---|---|
bin | 1100011101010100101… |
… | …11000110111111000111 |
3 | 1111220220020022100220022 |
4 | 12032222113012333013 |
5 | 24003131321300301 |
6 | 524351550125355 |
7 | 42632503341350 |
oct | 6165227067707 |
9 | 1456806270808 |
10 | 428059946951 |
11 | 1555a27538aa |
12 | 6ab644b085b |
13 | 3149aab7b50 |
14 | 16a0aab8d27 |
15 | b205051d1b |
hex | 63aa5c6fc7 |
428059946951 has 32 divisors (see below), whose sum is σ = 539796700800. Its totient is φ = 330360606720.
The previous prime is 428059946879. The next prime is 428059946957. The reversal of 428059946951 is 159649950824.
It is a cyclic number.
It is not a de Polignac number, because 428059946951 - 222 = 428055752647 is a prime.
It is a Smith number, since the sum of its digits (62) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (428059946957) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 31217885 + ... + 31231593.
It is an arithmetic number, because the mean of its divisors is an integer number (16868646900).
Almost surely, 2428059946951 is an apocalyptic number.
428059946951 is a gapful number since it is divisible by the number (41) formed by its first and last digit.
428059946951 is a deficient number, since it is larger than the sum of its proper divisors (111736753849).
428059946951 is a wasteful number, since it uses less digits than its factorization.
428059946951 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22139.
The product of its (nonzero) digits is 27993600, while the sum is 62.
The spelling of 428059946951 in words is "four hundred twenty-eight billion, fifty-nine million, nine hundred forty-six thousand, nine hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •