Base | Representation |
---|---|
bin | 10010010000111… |
… | …111101011101000 |
3 | 210100122000120000 |
4 | 102100333223220 |
5 | 1111422220112 |
6 | 50224103000 |
7 | 10410511515 |
oct | 2220775350 |
9 | 710560500 |
10 | 306445032 |
11 | 147a86763 |
12 | 86764a60 |
13 | 4b64652a |
14 | 2c9b030c |
15 | 1bd837dc |
hex | 1243fae8 |
306445032 has 40 divisors (see below), whose sum is σ = 858331650. Its totient is φ = 102148128.
The previous prime is 306444991. The next prime is 306445037. The reversal of 306445032 is 230544603.
It can be written as a sum of positive squares in only one way, i.e., 203747076 + 102697956 = 14274^2 + 10134^2 .
It is a super-3 number, since 3×3064450323 (a number of 26 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 306444987 and 306445005.
It is not an unprimeable number, because it can be changed into a prime (306445037) by changing a digit.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 235807 + ... + 237102.
Almost surely, 2306445032 is an apocalyptic number.
It is an amenable number.
306445032 is an abundant number, since it is smaller than the sum of its proper divisors (551886618).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
306445032 is a wasteful number, since it uses less digits than its factorization.
306445032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 472927 (or 472914 counting only the distinct ones).
The product of its (nonzero) digits is 8640, while the sum is 27.
The square root of 306445032 is about 17505.5714559680. The cubic root of 306445032 is about 674.1929317042.
Adding to 306445032 its reverse (230544603), we get a palindrome (536989635).
The spelling of 306445032 in words is "three hundred six million, four hundred forty-five thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •