Base | Representation |
---|---|
bin | 11100000010101101… |
… | …101011011111000101 |
3 | 2212201102211201200001 |
4 | 130002231223133011 |
5 | 443131214100401 |
6 | 21455452121301 |
7 | 2114106220330 |
oct | 340255533705 |
9 | 85642751601 |
10 | 30110300101 |
11 | 11851530142 |
12 | 5a03a66231 |
13 | 2abb1a3c2b |
14 | 1658d5b617 |
15 | bb3665601 |
hex | 702b6b7c5 |
30110300101 has 8 divisors (see below), whose sum is σ = 35143937280. Its totient is φ = 25259704368.
The previous prime is 30110299987. The next prime is 30110300113. The reversal of 30110300101 is 10100301103.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-30110300101 is a prime.
It is a super-2 number, since 2×301103001012 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30110300161) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 45760006 + ... + 45760663.
It is an arithmetic number, because the mean of its divisors is an integer number (4392992160).
Almost surely, 230110300101 is an apocalyptic number.
It is an amenable number.
30110300101 is a deficient number, since it is larger than the sum of its proper divisors (5033637179).
30110300101 is an equidigital number, since it uses as much as digits as its factorization.
30110300101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 91520723.
The product of its (nonzero) digits is 9, while the sum is 10.
Adding to 30110300101 its reverse (10100301103), we get a palindrome (40210601204).
The spelling of 30110300101 in words is "thirty billion, one hundred ten million, three hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •