Base | Representation |
---|---|
bin | 11100000100100110… |
… | …111111011010000001 |
3 | 2212210122200101110121 |
4 | 130010212333122001 |
5 | 443212334213441 |
6 | 21502545500241 |
7 | 2114643426556 |
oct | 340446773201 |
9 | 85718611417 |
10 | 30142101121 |
11 | 11868480780 |
12 | 5a12641681 |
13 | 2ac49598c2 |
14 | 165d278a2d |
15 | bb6347dd1 |
hex | 7049bf681 |
30142101121 has 4 divisors (see below), whose sum is σ = 32882292144. Its totient is φ = 27401910100.
The previous prime is 30142101091. The next prime is 30142101127. The reversal of 30142101121 is 12110124103.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 30142101121 - 27 = 30142100993 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 30142101095 and 30142101104.
It is not an unprimeable number, because it can be changed into a prime (30142101127) 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 3 ways as a sum of consecutive naturals, for example, 1370095495 + ... + 1370095516.
It is an arithmetic number, because the mean of its divisors is an integer number (8220573036).
Almost surely, 230142101121 is an apocalyptic number.
It is an amenable number.
30142101121 is a deficient number, since it is larger than the sum of its proper divisors (2740191023).
30142101121 is a wasteful number, since it uses less digits than its factorization.
30142101121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2740191022.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 30142101121 its reverse (12110124103), we get a palindrome (42252225224).
The spelling of 30142101121 in words is "thirty billion, one hundred forty-two million, one hundred one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •