Base | Representation |
---|---|
bin | 11100000001000010… |
… | …001001001100000011 |
3 | 2212122110210112102001 |
4 | 130001002021030003 |
5 | 443102010011321 |
6 | 21453004004431 |
7 | 2113314501136 |
oct | 340102111403 |
9 | 85573715361 |
10 | 30082110211 |
11 | 1183762670a |
12 | 59b6530717 |
13 | 2ab53b3b1a |
14 | 165530021d |
15 | bb0e47c91 |
hex | 701089303 |
30082110211 has 4 divisors (see below), whose sum is σ = 30085313400. Its totient is φ = 30078907024.
The previous prime is 30082110187. The next prime is 30082110241. The reversal of 30082110211 is 11201128003.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 11201128003 = 13 ⋅861625231.
It is a cyclic number.
It is not a de Polignac number, because 30082110211 - 27 = 30082110083 is a prime.
It is a super-3 number, since 3×300821102113 (a number of 32 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (30082110241) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1587466 + ... + 1606303.
It is an arithmetic number, because the mean of its divisors is an integer number (7521328350).
Almost surely, 230082110211 is an apocalyptic number.
30082110211 is a deficient number, since it is larger than the sum of its proper divisors (3203189).
30082110211 is an equidigital number, since it uses as much as digits as its factorization.
30082110211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3203188.
The product of its (nonzero) digits is 96, while the sum is 19.
Adding to 30082110211 its reverse (11201128003), we get a palindrome (41283238214).
The spelling of 30082110211 in words is "thirty billion, eighty-two million, one hundred ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •