Base | Representation |
---|---|
bin | 10010001101000… |
… | …001110111011101 |
3 | 210021200012110022 |
4 | 102031001313131 |
5 | 1111140433110 |
6 | 50145521525 |
7 | 10365621524 |
oct | 2215016735 |
9 | 707605408 |
10 | 305405405 |
11 | 147436668 |
12 | 863432a5 |
13 | 4b371276 |
14 | 2c7bd4bb |
15 | 1bc2a755 |
hex | 12341ddd |
305405405 has 4 divisors (see below), whose sum is σ = 366486492. Its totient is φ = 244324320.
The previous prime is 305405333. The next prime is 305405407. The reversal of 305405405 is 504504503.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 228281881 + 77123524 = 15109^2 + 8782^2 .
It is not a de Polignac number, because 305405405 - 210 = 305404381 is a prime.
It is a super-2 number, since 2×3054054052 = 186544922806428050, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (305405407) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 30540536 + ... + 30540545.
It is an arithmetic number, because the mean of its divisors is an integer number (91621623).
Almost surely, 2305405405 is an apocalyptic number.
It is an amenable number.
305405405 is a deficient number, since it is larger than the sum of its proper divisors (61081087).
305405405 is an equidigital number, since it uses as much as digits as its factorization.
305405405 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61081086.
The product of its (nonzero) digits is 6000, while the sum is 26.
The square root of 305405405 is about 17475.8520536196. The cubic root of 305405405 is about 673.4296590998.
Adding to 305405405 its reverse (504504503), we get a palindrome (809909908).
The spelling of 305405405 in words is "three hundred five million, four hundred five thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •