Base | Representation |
---|---|
bin | 10010001110000… |
… | …000110111000100 |
3 | 210022011022101201 |
4 | 102032000313010 |
5 | 1111222212203 |
6 | 50155232244 |
7 | 10401045010 |
oct | 2216006704 |
9 | 708138351 |
10 | 305663428 |
11 | 1475a2504 |
12 | 86448684 |
13 | 4b431845 |
14 | 2c849540 |
15 | 1bc7be1d |
hex | 12380dc4 |
305663428 has 12 divisors (see below), whose sum is σ = 611326912. Its totient is φ = 130998600.
The previous prime is 305663329. The next prime is 305663459. The reversal of 305663428 is 824366503.
305663428 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
305663428 is an admirable number.
It is a super-2 number, since 2×3056634282 = 186860262433422368, which contains 22 as substring.
It is a hoax number, since the sum of its digits (37) coincides with the sum of the digits of its distinct prime factors.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5458248 + ... + 5458303.
Almost surely, 2305663428 is an apocalyptic number.
It is an amenable number.
305663428 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
305663428 is a wasteful number, since it uses less digits than its factorization.
305663428 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10916562 (or 10916560 counting only the distinct ones).
The product of its (nonzero) digits is 103680, while the sum is 37.
The square root of 305663428 is about 17483.2327674261. The cubic root of 305663428 is about 673.6192556459.
The spelling of 305663428 in words is "three hundred five million, six hundred sixty-three thousand, four hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •