Base | Representation |
---|---|
bin | 11100000100011111… |
… | …000100001001111101 |
3 | 2212210111202211101202 |
4 | 130010133010021331 |
5 | 443211321222141 |
6 | 21502433145245 |
7 | 2114616654254 |
oct | 340437041175 |
9 | 85714684352 |
10 | 30140023421 |
11 | 11867291772 |
12 | 5a119bb225 |
13 | 2ac43accb1 |
14 | 165cc9779b |
15 | bb608749b |
hex | 7047c427d |
30140023421 has 2 divisors, whose sum is σ = 30140023422. Its totient is φ = 30140023420.
The previous prime is 30140023393. The next prime is 30140023453. The reversal of 30140023421 is 12432004103.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 15354679396 + 14785344025 = 123914^2 + 121595^2 .
It is a cyclic number.
It is not a de Polignac number, because 30140023421 - 222 = 30135829117 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 30140023393 and 30140023402.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30142023421) 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 as a sum of consecutive naturals, namely, 15070011710 + 15070011711.
It is an arithmetic number, because the mean of its divisors is an integer number (15070011711).
Almost surely, 230140023421 is an apocalyptic number.
It is an amenable number.
30140023421 is a deficient number, since it is larger than the sum of its proper divisors (1).
30140023421 is an equidigital number, since it uses as much as digits as its factorization.
30140023421 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 576, while the sum is 20.
Adding to 30140023421 its reverse (12432004103), we get a palindrome (42572027524).
The spelling of 30140023421 in words is "thirty billion, one hundred forty million, twenty-three thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •