Base | Representation |
---|---|
bin | 11100000010001110… |
… | …000100011000001101 |
3 | 2212200212020201112011 |
4 | 130002032010120031 |
5 | 443122103412303 |
6 | 21454554341221 |
7 | 2113645615111 |
oct | 340216043015 |
9 | 85625221464 |
10 | 30102013453 |
11 | 11847890276 |
12 | 5a0112a811 |
13 | 2ab95621a5 |
14 | 1657c01741 |
15 | bb2a7a16d |
hex | 70238460d |
30102013453 has 2 divisors, whose sum is σ = 30102013454. Its totient is φ = 30102013452.
The previous prime is 30102013391. The next prime is 30102013541. The reversal of 30102013453 is 35431020103.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 15076647369 + 15025366084 = 122787^2 + 122578^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-30102013453 is a prime.
It is a super-3 number, since 3×301020134533 (a number of 32 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30102023453) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15051006726 + 15051006727.
It is an arithmetic number, because the mean of its divisors is an integer number (15051006727).
Almost surely, 230102013453 is an apocalyptic number.
It is an amenable number.
30102013453 is a deficient number, since it is larger than the sum of its proper divisors (1).
30102013453 is an equidigital number, since it uses as much as digits as its factorization.
30102013453 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1080, while the sum is 22.
Adding to 30102013453 its reverse (35431020103), we get a palindrome (65533033556).
The spelling of 30102013453 in words is "thirty billion, one hundred two million, thirteen thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •