Base | Representation |
---|---|
bin | 10010001111100… |
… | …000011110001010 |
3 | 210022220012121020 |
4 | 102033200132022 |
5 | 1111322230200 |
6 | 50211453310 |
7 | 10404265530 |
oct | 2217403612 |
9 | 708805536 |
10 | 306055050 |
11 | 14783a764 |
12 | 865b7236 |
13 | 4b53ab82 |
14 | 2c90c150 |
15 | 1bd07ea0 |
hex | 123e078a |
306055050 has 48 divisors (see below), whose sum is σ = 867450432. Its totient is φ = 69955200.
The previous prime is 306055049. The next prime is 306055051. The reversal of 306055050 is 50550603.
It is an interprime number because it is at equal distance from previous prime (306055049) and next prime (306055051).
It is a self number, because there is not a number n which added to its sum of digits gives 306055050.
It is not an unprimeable number, because it can be changed into a prime (306055051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 144691 + ... + 146790.
It is an arithmetic number, because the mean of its divisors is an integer number (18071884).
Almost surely, 2306055050 is an apocalyptic number.
306055050 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
306055050 is an abundant number, since it is smaller than the sum of its proper divisors (561395382).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
306055050 is a wasteful number, since it uses less digits than its factorization.
306055050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 291503 (or 291498 counting only the distinct ones).
The product of its (nonzero) digits is 2250, while the sum is 24.
The square root of 306055050 is about 17494.4291132920. The cubic root of 306055050 is about 673.9068176203.
The spelling of 306055050 in words is "three hundred six million, fifty-five thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •