Base | Representation |
---|---|
bin | 11011111100111111… |
… | …111100010001000011 |
3 | 2212110202102201120012 |
4 | 123330333330101003 |
5 | 442432143033011 |
6 | 21442145135135 |
7 | 2111533252466 |
oct | 337477742103 |
9 | 85422381505 |
10 | 30014424131 |
11 | 118023a60aa |
12 | 599792a4ab |
13 | 2aa43755a3 |
14 | 164a3212dd |
15 | baa027a8b |
hex | 6fcffc443 |
30014424131 has 4 divisors (see below), whose sum is σ = 30015392472. Its totient is φ = 30013455792.
The previous prime is 30014424119. The next prime is 30014424157. The reversal of 30014424131 is 13142441003.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 13142441003 = 26839 ⋅489677.
It is a cyclic number.
It is not a de Polignac number, because 30014424131 - 234 = 12834554947 is a prime.
It is a super-2 number, since 2×300144241312 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 30014424097 and 30014424106.
It is not an unprimeable number, because it can be changed into a prime (30010424131) 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, 436085 + ... + 500198.
It is an arithmetic number, because the mean of its divisors is an integer number (7503848118).
Almost surely, 230014424131 is an apocalyptic number.
30014424131 is a deficient number, since it is larger than the sum of its proper divisors (968341).
30014424131 is an equidigital number, since it uses as much as digits as its factorization.
30014424131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 968340.
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 30014424131 its reverse (13142441003), we get a palindrome (43156865134).
The spelling of 30014424131 in words is "thirty billion, fourteen million, four hundred twenty-four thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •