Base | Representation |
---|---|
bin | 10010010001110… |
… | …010100000100101 |
3 | 210101000121010201 |
4 | 102101302200211 |
5 | 1112000400341 |
6 | 50232350501 |
7 | 10412336500 |
oct | 2221624045 |
9 | 711017121 |
10 | 306653221 |
11 | 148109116 |
12 | 86845431 |
13 | 4b6ba214 |
14 | 2ca26137 |
15 | 1bdc5331 |
hex | 12472825 |
306653221 has 12 divisors (see below), whose sum is σ = 369021420. Its totient is φ = 253780800.
The previous prime is 306653203. The next prime is 306653233. The reversal of 306653221 is 122356603.
It can be written as a sum of positive squares in 2 ways, for example, as 177262596 + 129390625 = 13314^2 + 11375^2 .
It is not a de Polignac number, because 306653221 - 213 = 306645029 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 306653221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (306653201) 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 11 ways as a sum of consecutive naturals, for example, 106480 + ... + 109321.
It is an arithmetic number, because the mean of its divisors is an integer number (30751785).
Almost surely, 2306653221 is an apocalyptic number.
It is an amenable number.
306653221 is a deficient number, since it is larger than the sum of its proper divisors (62368199).
306653221 is a wasteful number, since it uses less digits than its factorization.
306653221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 215844 (or 215837 counting only the distinct ones).
The product of its (nonzero) digits is 6480, while the sum is 28.
The square root of 306653221 is about 17511.5168103737. The cubic root of 306653221 is about 674.3455722154.
The spelling of 306653221 in words is "three hundred six million, six hundred fifty-three thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •