Base | Representation |
---|---|
bin | 111001111111… |
… | …0111000101101 |
3 | 2010012200122022 |
4 | 1303332320231 |
5 | 30240413031 |
6 | 3003355525 |
7 | 516300545 |
oct | 163767055 |
9 | 63180568 |
10 | 30404141 |
11 | 16187099 |
12 | a222ba5 |
13 | 63b6c21 |
14 | 4076325 |
15 | 2a0897b |
hex | 1cfee2d |
30404141 has 4 divisors (see below), whose sum is σ = 30417792. Its totient is φ = 30390492.
The previous prime is 30404111. The next prime is 30404167. The reversal of 30404141 is 14140403.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 14140403 = 673 ⋅21011.
It is a cyclic number.
It is not a de Polignac number, because 30404141 - 210 = 30403117 is a prime.
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 (30404111) 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 3 ways as a sum of consecutive naturals, for example, 2621 + ... + 8226.
It is an arithmetic number, because the mean of its divisors is an integer number (7604448).
Almost surely, 230404141 is an apocalyptic number.
It is an amenable number.
30404141 is a deficient number, since it is larger than the sum of its proper divisors (13651).
30404141 is a wasteful number, since it uses less digits than its factorization.
30404141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13650.
The product of its (nonzero) digits is 192, while the sum is 17.
The square root of 30404141 is about 5513.9950126927. The cubic root of 30404141 is about 312.1123205337.
Adding to 30404141 its reverse (14140403), we get a palindrome (44544544).
The spelling of 30404141 in words is "thirty million, four hundred four thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.238 sec. • engine limits •