Base | Representation |
---|---|
bin | 11011111100010010… |
… | …100110111111110011 |
3 | 2212102221001222022212 |
4 | 123330102212333303 |
5 | 442421122244111 |
6 | 21441042322335 |
7 | 2111330246435 |
oct | 337422467763 |
9 | 85387058285 |
10 | 30002540531 |
11 | 117a6719847 |
12 | 59939593ab |
13 | 2aa1a74582 |
14 | 164890a655 |
15 | ba8e7b98b |
hex | 6fc4a6ff3 |
30002540531 has 4 divisors (see below), whose sum is σ = 30008627472. Its totient is φ = 29996453592.
The previous prime is 30002540489. The next prime is 30002540551. The reversal of 30002540531 is 13504520003.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 13504520003 = 13 ⋅1038809231.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-30002540531 is a prime.
It is a super-2 number, since 2×300025405312 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 30002540497 and 30002540506.
It is not an unprimeable number, because it can be changed into a prime (30002540551) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3036071 + ... + 3045936.
It is an arithmetic number, because the mean of its divisors is an integer number (7502156868).
Almost surely, 230002540531 is an apocalyptic number.
30002540531 is a deficient number, since it is larger than the sum of its proper divisors (6086941).
30002540531 is an equidigital number, since it uses as much as digits as its factorization.
30002540531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6086940.
The product of its (nonzero) digits is 1800, while the sum is 23.
The spelling of 30002540531 in words is "thirty billion, two million, five hundred forty thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •