Base | Representation |
---|---|
bin | 10010001101000… |
… | …011100110011001 |
3 | 210021200120012021 |
4 | 102031003212121 |
5 | 1111141200010 |
6 | 50150014441 |
7 | 10365651316 |
oct | 2215034631 |
9 | 707616167 |
10 | 305412505 |
11 | 147440a32 |
12 | 86347421 |
13 | 4b374578 |
14 | 2c7c1d0d |
15 | 1bc2c8da |
hex | 12343999 |
305412505 has 8 divisors (see below), whose sum is σ = 366812424. Its totient is φ = 244118400.
The previous prime is 305412493. The next prime is 305412529. The reversal of 305412505 is 505214503.
It can be written as a sum of positive squares in 4 ways, for example, as 27290176 + 278122329 = 5224^2 + 16677^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 305412505 - 225 = 271858073 is a prime.
It is an alternating number because its digits alternate between odd and even.
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 305412505.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 19956 + ... + 31765.
It is an arithmetic number, because the mean of its divisors is an integer number (45851553).
Almost surely, 2305412505 is an apocalyptic number.
It is an amenable number.
305412505 is a deficient number, since it is larger than the sum of its proper divisors (61399919).
305412505 is a wasteful number, since it uses less digits than its factorization.
305412505 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52907.
The product of its (nonzero) digits is 3000, while the sum is 25.
The square root of 305412505 is about 17476.0551898877. The cubic root of 305412505 is about 673.4348776426.
The spelling of 305412505 in words is "three hundred five million, four hundred twelve thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •