Base | Representation |
---|---|
bin | 10010001111100… |
… | …001001110010100 |
3 | 210022220100211101 |
4 | 102033201032110 |
5 | 1111322330012 |
6 | 50211515444 |
7 | 10404310522 |
oct | 2217411624 |
9 | 708810741 |
10 | 306058132 |
11 | 147842006 |
12 | 865b8b84 |
13 | 4b53c3b3 |
14 | 2c90d312 |
15 | 1bd08d57 |
hex | 123e1394 |
306058132 has 12 divisors (see below), whose sum is σ = 536567220. Its totient is φ = 152753216.
The previous prime is 306058057. The next prime is 306058139. The reversal of 306058132 is 231850603.
306058132 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 47941776 + 258116356 = 6924^2 + 16066^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 306058132.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (306058139) 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 3 ways as a sum of consecutive naturals, for example, 66457 + ... + 70912.
It is an arithmetic number, because the mean of its divisors is an integer number (44713935).
Almost surely, 2306058132 is an apocalyptic number.
It is an amenable number.
306058132 is a deficient number, since it is larger than the sum of its proper divisors (230509088).
306058132 is a wasteful number, since it uses less digits than its factorization.
306058132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 137930 (or 137928 counting only the distinct ones).
The product of its (nonzero) digits is 4320, while the sum is 28.
The square root of 306058132 is about 17494.5171982539. The cubic root of 306058132 is about 673.9090797121.
The spelling of 306058132 in words is "three hundred six million, fifty-eight thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •