Base | Representation |
---|---|
bin | 10010010000000… |
… | …110111100011000 |
3 | 210100012012202121 |
4 | 102100012330120 |
5 | 1111342301012 |
6 | 50215111024 |
7 | 10405523125 |
oct | 2220067430 |
9 | 710165677 |
10 | 306212632 |
11 | 1479380a0 |
12 | 86672474 |
13 | 4b59480b |
14 | 2c94d74c |
15 | 1bd39a07 |
hex | 12406f18 |
306212632 has 32 divisors (see below), whose sum is σ = 640918080. Its totient is φ = 135948960.
The previous prime is 306212609. The next prime is 306212633. The reversal of 306212632 is 236212603.
It is a happy number.
306212632 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 306212597 and 306212606.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (306212633) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 36678 + ... + 44245.
It is an arithmetic number, because the mean of its divisors is an integer number (20028690).
Almost surely, 2306212632 is an apocalyptic number.
It is an amenable number.
306212632 is an abundant number, since it is smaller than the sum of its proper divisors (334705448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
306212632 is a wasteful number, since it uses less digits than its factorization.
306212632 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 80983 (or 80979 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 25.
The square root of 306212632 is about 17498.9323102868. The cubic root of 306212632 is about 674.0224584321.
The spelling of 306212632 in words is "three hundred six million, two hundred twelve thousand, six hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •