Base | Representation |
---|---|
bin | 1100011101101100100… |
… | …11011001100100000000 |
3 | 1111221102012022102001201 |
4 | 12032312103121210000 |
5 | 24004034114113211 |
6 | 524423504310544 |
7 | 42640455332200 |
oct | 6166623314400 |
9 | 1457365272051 |
10 | 428260301056 |
11 | 155695858905 |
12 | 6abbb612454 |
13 | 31500467383 |
14 | 16a29550400 |
15 | b21792b0c1 |
hex | 63b64d9900 |
428260301056 has 81 divisors (see below), whose sum is σ = 994584901611. Its totient is φ = 183508717056.
The previous prime is 428260300999. The next prime is 428260301057. The reversal of 428260301056 is 650103062824.
The square root of 428260301056 is 654416.
It is a perfect power (a square), and thus also a powerful number.
It is not an unprimeable number, because it can be changed into a prime (428260301057) 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 8 ways as a sum of consecutive naturals, for example, 73291671 + ... + 73297513.
Almost surely, 2428260301056 is an apocalyptic number.
428260301056 is the 654416-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 428260301056
428260301056 is an abundant number, since it is smaller than the sum of its proper divisors (566324600555).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
428260301056 is an frugal number, since it uses more digits than its factorization.
428260301056 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11716 (or 5852 counting only the distinct ones).
The product of its (nonzero) digits is 69120, while the sum is 37.
It can be divided in two parts, 428260 and 301056, that added together give a square (729316 = 8542).
The spelling of 428260301056 in words is "four hundred twenty-eight billion, two hundred sixty million, three hundred one thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •