Base | Representation |
---|---|
bin | 10010001101000… |
… | …010000001101101 |
3 | 210021200020100121 |
4 | 102031002001231 |
5 | 1111140443221 |
6 | 50145524541 |
7 | 10365623452 |
oct | 2215020155 |
9 | 707606317 |
10 | 305406061 |
11 | 147437104 |
12 | 86343751 |
13 | 4b37165c |
14 | 2c7bd829 |
15 | 1bc2aa41 |
hex | 1234206d |
305406061 has 4 divisors (see below), whose sum is σ = 306281500. Its totient is φ = 304530624.
The previous prime is 305405999. The next prime is 305406083. The reversal of 305406061 is 160604503.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 160604503 = 41 ⋅3917183.
It can be written as a sum of positive squares in 2 ways, for example, as 231617961 + 73788100 = 15219^2 + 8590^2 .
It is a cyclic number.
It is not a de Polignac number, because 305406061 - 29 = 305405549 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (305406161) 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 3 ways as a sum of consecutive naturals, for example, 437196 + ... + 437893.
It is an arithmetic number, because the mean of its divisors is an integer number (76570375).
Almost surely, 2305406061 is an apocalyptic number.
It is an amenable number.
305406061 is a deficient number, since it is larger than the sum of its proper divisors (875439).
305406061 is an equidigital number, since it uses as much as digits as its factorization.
305406061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 875438.
The product of its (nonzero) digits is 2160, while the sum is 25.
The square root of 305406061 is about 17475.8708223653. The cubic root of 305406061 is about 673.4301412672.
The spelling of 305406061 in words is "three hundred five million, four hundred six thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •