Base | Representation |
---|---|
bin | 11100010100001110… |
… | …100110000101100101 |
3 | 2220110220202102011121 |
4 | 130110032212011211 |
5 | 444231430011123 |
6 | 21544550133541 |
7 | 2124304636462 |
oct | 342416460545 |
9 | 86426672147 |
10 | 30404141413 |
11 | 119923884a8 |
12 | 5a863512b1 |
13 | 2b37026729 |
14 | 1685daa669 |
15 | bce35975d |
hex | 7143a6165 |
30404141413 has 4 divisors (see below), whose sum is σ = 30471857100. Its totient is φ = 30336425728.
The previous prime is 30404141407. The next prime is 30404141447. The reversal of 30404141413 is 31414140403.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 31414140403 = 43853 ⋅716351.
It can be written as a sum of positive squares in 2 ways, for example, as 13285559169 + 17118582244 = 115263^2 + 130838^2 .
It is a cyclic number.
It is not a de Polignac number, because 30404141413 - 217 = 30404010341 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 (30404141483) 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, 33857170 + ... + 33858067.
It is an arithmetic number, because the mean of its divisors is an integer number (7617964275).
Almost surely, 230404141413 is an apocalyptic number.
It is an amenable number.
30404141413 is a deficient number, since it is larger than the sum of its proper divisors (67715687).
30404141413 is an equidigital number, since it uses as much as digits as its factorization.
30404141413 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 67715686.
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 30404141413 its reverse (31414140403), we get a palindrome (61818281816).
The spelling of 30404141413 in words is "thirty billion, four hundred four million, one hundred forty-one thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •