Base | Representation |
---|---|
bin | 11100000010110000… |
… | …110001110010001101 |
3 | 2212201111100222211201 |
4 | 130002300301302031 |
5 | 443131421043313 |
6 | 21455521345501 |
7 | 2114116142341 |
oct | 340260616215 |
9 | 85644328751 |
10 | 30111112333 |
11 | 11851a35405 |
12 | 5a04198291 |
13 | 2abb3c9843 |
14 | 16590cd621 |
15 | bb37760dd |
hex | 702c31c8d |
30111112333 has 4 divisors (see below), whose sum is σ = 30387361180. Its totient is φ = 29834863488.
The previous prime is 30111112327. The next prime is 30111112337. The reversal of 30111112333 is 33321111103.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 15579533124 + 14531579209 = 124818^2 + 120547^2 .
It is a cyclic number.
It is not a de Polignac number, because 30111112333 - 25 = 30111112301 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 30111112333.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30111112337) 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, 138124260 + ... + 138124477.
It is an arithmetic number, because the mean of its divisors is an integer number (7596840295).
Almost surely, 230111112333 is an apocalyptic number.
It is an amenable number.
30111112333 is a deficient number, since it is larger than the sum of its proper divisors (276248847).
30111112333 is a wasteful number, since it uses less digits than its factorization.
30111112333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 276248846.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 30111112333 its reverse (33321111103), we get a palindrome (63432223436).
The spelling of 30111112333 in words is "thirty billion, one hundred eleven million, one hundred twelve thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •