Base | Representation |
---|---|
bin | 11100000010101100… |
… | …100101011100011011 |
3 | 2212201102022011010111 |
4 | 130002230211130123 |
5 | 443131130410321 |
6 | 21455442025151 |
7 | 2114103614035 |
oct | 340254453433 |
9 | 85642264114 |
10 | 30110013211 |
11 | 11851354643 |
12 | 5a039481b7 |
13 | 2abb103485 |
14 | 1658cc4c55 |
15 | bb360a5e1 |
hex | 702b2571b |
30110013211 has 8 divisors (see below), whose sum is σ = 30315492864. Its totient is φ = 29904613800.
The previous prime is 30110013191. The next prime is 30110013257. The reversal of 30110013211 is 11231001103.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 30110013211 - 229 = 29573142299 is a prime.
It is a super-2 number, since 2×301100132112 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 30110013191 and 30110013200.
It is not an unprimeable number, because it can be changed into a prime (30110013511) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 865230 + ... + 899356.
It is an arithmetic number, because the mean of its divisors is an integer number (3789436608).
Almost surely, 230110013211 is an apocalyptic number.
30110013211 is a deficient number, since it is larger than the sum of its proper divisors (205479653).
30110013211 is a wasteful number, since it uses less digits than its factorization.
30110013211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40121.
The product of its (nonzero) digits is 18, while the sum is 13.
Adding to 30110013211 its reverse (11231001103), we get a palindrome (41341014314).
The spelling of 30110013211 in words is "thirty billion, one hundred ten million, thirteen thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •