Base | Representation |
---|---|
bin | 1100100001001111010… |
… | …11111100011000101000 |
3 | 1112010022202202012112010 |
4 | 12100213223330120220 |
5 | 24021433103414202 |
6 | 525340340315520 |
7 | 43035554302224 |
oct | 6204753743050 |
9 | 1463282665463 |
10 | 430162560552 |
11 | 15648160759a |
12 | 6b4506a2ba0 |
13 | 317445ac4ca |
14 | 16b6a045784 |
15 | b2c993376c |
hex | 6427afc628 |
430162560552 has 128 divisors (see below), whose sum is σ = 1132832194560. Its totient is φ = 135852837120.
The previous prime is 430162560521. The next prime is 430162560593. The reversal of 430162560552 is 255065261034.
It is a self number, because there is not a number n which added to its sum of digits gives 430162560552.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 46334103 + ... + 46343385.
It is an arithmetic number, because the mean of its divisors is an integer number (8850251520).
Almost surely, 2430162560552 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 430162560552, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (566416097280).
430162560552 is an abundant number, since it is smaller than the sum of its proper divisors (702669634008).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
430162560552 is a wasteful number, since it uses less digits than its factorization.
430162560552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10103 (or 10099 counting only the distinct ones).
The product of its (nonzero) digits is 216000, while the sum is 39.
The spelling of 430162560552 in words is "four hundred thirty billion, one hundred sixty-two million, five hundred sixty thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •