Base | Representation |
---|---|
bin | 11100000011111000… |
… | …110111101111101001 |
3 | 2212202210221011002112 |
4 | 130003320313233221 |
5 | 443201240323423 |
6 | 21501434412105 |
7 | 2114435603666 |
oct | 340370675751 |
9 | 85683834075 |
10 | 30130011113 |
11 | 11861673334 |
12 | 5a0a591035 |
13 | 2ac22b5957 |
14 | 165b80ca6d |
15 | bb525aa78 |
hex | 703e37be9 |
30130011113 has 4 divisors (see below), whose sum is σ = 30255032148. Its totient is φ = 30004990080.
The previous prime is 30130011101. The next prime is 30130011127. The reversal of 30130011113 is 31111003103.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 31111003103 = 191 ⋅162884833.
It can be written as a sum of positive squares in 2 ways, for example, as 21490680409 + 8639330704 = 146597^2 + 92948^2 .
It is a cyclic number.
It is not a de Polignac number, because 30130011113 - 26 = 30130011049 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (30130011173) 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, 62510156 + ... + 62510637.
It is an arithmetic number, because the mean of its divisors is an integer number (7563758037).
Almost surely, 230130011113 is an apocalyptic number.
It is an amenable number.
30130011113 is a deficient number, since it is larger than the sum of its proper divisors (125021035).
30130011113 is a wasteful number, since it uses less digits than its factorization.
30130011113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 125021034.
The product of its (nonzero) digits is 27, while the sum is 14.
Adding to 30130011113 its reverse (31111003103), we get a palindrome (61241014216).
The spelling of 30130011113 in words is "thirty billion, one hundred thirty million, eleven thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •