Base | Representation |
---|---|
bin | 11100010100001110… |
… | …001001011111110001 |
3 | 2220110220112110112021 |
4 | 130110032021133301 |
5 | 444231412234210 |
6 | 21544543431441 |
7 | 2124303641164 |
oct | 342416113761 |
9 | 86426473467 |
10 | 30404024305 |
11 | 11992308516 |
12 | 5a862b5581 |
13 | 2b36cb5335 |
14 | 1685d79adb |
15 | bce334bda |
hex | 7143897f1 |
30404024305 has 8 divisors (see below), whose sum is σ = 36523772712. Its totient is φ = 24297257088.
The previous prime is 30404024297. The next prime is 30404024309. The reversal of 30404024305 is 50342040403.
It can be written as a sum of positive squares in 4 ways, for example, as 4014996496 + 26389027809 = 63364^2 + 162447^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 30404024305 - 23 = 30404024297 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 30404024305.
It is not an unprimeable number, because it can be changed into a prime (30404024309) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3240142 + ... + 3249511.
It is an arithmetic number, because the mean of its divisors is an integer number (4565471589).
Almost surely, 230404024305 is an apocalyptic number.
It is an amenable number.
30404024305 is a deficient number, since it is larger than the sum of its proper divisors (6119748407).
30404024305 is an equidigital number, since it uses as much as digits as its factorization.
30404024305 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6490595.
The product of its (nonzero) digits is 5760, while the sum is 25.
Adding to 30404024305 its reverse (50342040403), we get a palindrome (80746064708).
The spelling of 30404024305 in words is "thirty billion, four hundred four million, twenty-four thousand, three hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •