Base | Representation |
---|---|
bin | 10010001111111… |
… | …011000111101001 |
3 | 210100002202022212 |
4 | 102033323013221 |
5 | 1111334223301 |
6 | 50214054505 |
7 | 10405232000 |
oct | 2217730751 |
9 | 710082285 |
10 | 306164201 |
11 | 147904772 |
12 | 8664a435 |
13 | 4b578765 |
14 | 2c939c37 |
15 | 1bd2a4bb |
hex | 123fb1e9 |
306164201 has 24 divisors (see below), whose sum is σ = 374467200. Its totient is φ = 249742416.
The previous prime is 306164189. The next prime is 306164213. The reversal of 306164201 is 102461603.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (306164189) and next prime (306164213).
It is not a de Polignac number, because 306164201 - 26 = 306164137 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (306163201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1554035 + ... + 1554231.
It is an arithmetic number, because the mean of its divisors is an integer number (15602800).
Almost surely, 2306164201 is an apocalyptic number.
It is an amenable number.
306164201 is a deficient number, since it is larger than the sum of its proper divisors (68302999).
306164201 is an frugal number, since it uses more digits than its factorization.
306164201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 438 (or 227 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 23.
The square root of 306164201 is about 17497.5484282799. The cubic root of 306164201 is about 673.9869217936.
The spelling of 306164201 in words is "three hundred six million, one hundred sixty-four thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •