Base | Representation |
---|---|
bin | 11100000100100011… |
… | …010000111000010001 |
3 | 2212210120211202021010 |
4 | 130010203100320101 |
5 | 443212111432423 |
6 | 21502512521133 |
7 | 2114632220262 |
oct | 340443207021 |
9 | 85716752233 |
10 | 30141124113 |
11 | 11867973731 |
12 | 5a122501a9 |
13 | 2ac46a6ca9 |
14 | 165d0a2969 |
15 | bb6203693 |
hex | 7048d0e11 |
30141124113 has 8 divisors (see below), whose sum is σ = 40193263168. Its totient is φ = 20091533904.
The previous prime is 30141124093. The next prime is 30141124121. The reversal of 30141124113 is 31142114103.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 30141124113 - 25 = 30141124081 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 30141124113.
It is not an unprimeable number, because it can be changed into a prime (30141124133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 609445 + ... + 657042.
It is an arithmetic number, because the mean of its divisors is an integer number (5024157896).
Almost surely, 230141124113 is an apocalyptic number.
It is an amenable number.
30141124113 is a deficient number, since it is larger than the sum of its proper divisors (10052139055).
30141124113 is a wasteful number, since it uses less digits than its factorization.
30141124113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1274423.
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 30141124113 its reverse (31142114103), we get a palindrome (61283238216).
The spelling of 30141124113 in words is "thirty billion, one hundred forty-one million, one hundred twenty-four thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •