Base | Representation |
---|---|
bin | 11100000010110100… |
… | …100011011011011111 |
3 | 2212201120020021120011 |
4 | 130002310203123133 |
5 | 443132144231421 |
6 | 21455554504051 |
7 | 2114130434110 |
oct | 340264433337 |
9 | 85646207504 |
10 | 30112102111 |
11 | 11852551003 |
12 | 5a04595027 |
13 | 2abb685200 |
14 | 16592aa207 |
15 | bb38be4e1 |
hex | 702d236df |
30112102111 has 12 divisors (see below), whose sum is σ = 37264682352. Its totient is φ = 23824958976.
The previous prime is 30112102103. The next prime is 30112102133. The reversal of 30112102111 is 11120121103.
It is a happy number.
It is not a de Polignac number, because 30112102111 - 23 = 30112102103 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 30112102091 and 30112102100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30112102211) 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 11 ways as a sum of consecutive naturals, for example, 12725826 + ... + 12728191.
It is an arithmetic number, because the mean of its divisors is an integer number (3105390196).
Almost surely, 230112102111 is an apocalyptic number.
30112102111 is a deficient number, since it is larger than the sum of its proper divisors (7152580241).
30112102111 is a wasteful number, since it uses less digits than its factorization.
30112102111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25454050 (or 25454037 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 30112102111 its reverse (11120121103), we get a palindrome (41232223214).
The spelling of 30112102111 in words is "thirty billion, one hundred twelve million, one hundred two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •