Base | Representation |
---|---|
bin | 11100000010001110… |
… | …000100010010100101 |
3 | 2212200212020201000211 |
4 | 130002032010102211 |
5 | 443122103404333 |
6 | 21454554335421 |
7 | 2113645614055 |
oct | 340216042245 |
9 | 85625221024 |
10 | 30102013093 |
11 | 1184788aa79 |
12 | 5a0112a571 |
13 | 2ab9561c89 |
14 | 1657c01565 |
15 | bb2a79ecd |
hex | 7023844a5 |
30102013093 has 2 divisors, whose sum is σ = 30102013094. Its totient is φ = 30102013092.
The previous prime is 30102013091. The next prime is 30102013127. The reversal of 30102013093 is 39031020103.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 25027872804 + 5074140289 = 158202^2 + 71233^2 .
It is a cyclic number.
It is not a de Polignac number, because 30102013093 - 21 = 30102013091 is a prime.
It is a super-2 number, since 2×301020130932 (a number of 22 digits) contains 22 as substring.
Together with 30102013091, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30102013091) 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, 15051006546 + 15051006547.
It is an arithmetic number, because the mean of its divisors is an integer number (15051006547).
Almost surely, 230102013093 is an apocalyptic number.
It is an amenable number.
30102013093 is a deficient number, since it is larger than the sum of its proper divisors (1).
30102013093 is an equidigital number, since it uses as much as digits as its factorization.
30102013093 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 486, while the sum is 22.
Adding to 30102013093 its reverse (39031020103), we get a palindrome (69133033196).
The spelling of 30102013093 in words is "thirty billion, one hundred two million, thirteen thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •