Base | Representation |
---|---|
bin | 11100000011010111… |
… | …110000110110010001 |
3 | 2212202012121012202002 |
4 | 130003113300312101 |
5 | 443142030111423 |
6 | 21500524403345 |
7 | 2114302045535 |
oct | 340327606621 |
9 | 85665535662 |
10 | 30121332113 |
11 | 11857785704 |
12 | 5a076a6555 |
13 | 2ac0567452 |
14 | 165a5cdbc5 |
15 | bb45e4228 |
hex | 7035f0d91 |
30121332113 has 4 divisors (see below), whose sum is σ = 30689659188. Its totient is φ = 29553005040.
The previous prime is 30121332103. The next prime is 30121332119. The reversal of 30121332113 is 31123312103.
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 11029830529 + 19091501584 = 105023^2 + 138172^2 .
It is a cyclic number.
It is not a de Polignac number, because 30121332113 - 26 = 30121332049 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (30121332119) 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, 284163458 + ... + 284163563.
It is an arithmetic number, because the mean of its divisors is an integer number (7672414797).
Almost surely, 230121332113 is an apocalyptic number.
It is an amenable number.
30121332113 is a deficient number, since it is larger than the sum of its proper divisors (568327075).
30121332113 is an equidigital number, since it uses as much as digits as its factorization.
30121332113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 568327074.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 30121332113 its reverse (31123312103), we get a palindrome (61244644216).
The spelling of 30121332113 in words is "thirty billion, one hundred twenty-one million, three hundred thirty-two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •