Base | Representation |
---|---|
bin | 11100010000100011… |
… | …110101111000101001 |
3 | 2220022121221220100111 |
4 | 130100203311320221 |
5 | 444120201233111 |
6 | 21534511134321 |
7 | 2122626602215 |
oct | 342043657051 |
9 | 86277856314 |
10 | 30342602281 |
11 | 11960676212 |
12 | 5a698143a1 |
13 | 2b2735b044 |
14 | 167bb4b945 |
15 | bc8c50a21 |
hex | 7108f5e29 |
30342602281 has 4 divisors (see below), whose sum is σ = 30398688964. Its totient is φ = 30286515600.
The previous prime is 30342602221. The next prime is 30342602333. The reversal of 30342602281 is 18220624303.
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 11026050025 + 19316552256 = 105005^2 + 138984^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-30342602281 is a prime.
It is a super-2 number, since 2×303426022812 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (30342602221) 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, 28042530 + ... + 28043611.
It is an arithmetic number, because the mean of its divisors is an integer number (7599672241).
Almost surely, 230342602281 is an apocalyptic number.
It is an amenable number.
30342602281 is a deficient number, since it is larger than the sum of its proper divisors (56086683).
30342602281 is an equidigital number, since it uses as much as digits as its factorization.
30342602281 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56086682.
The product of its (nonzero) digits is 13824, while the sum is 31.
The spelling of 30342602281 in words is "thirty billion, three hundred forty-two million, six hundred two thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •