Base | Representation |
---|---|
bin | 11100010101110010… |
… | …001110101101100101 |
3 | 2220112201220101020020 |
4 | 130111302032231211 |
5 | 444310121310234 |
6 | 21551322025353 |
7 | 2125042641246 |
oct | 342562165545 |
9 | 86481811206 |
10 | 30430260069 |
11 | 119a60a7870 |
12 | 5a93048259 |
13 | 2b3c56cb61 |
14 | 1689648ccd |
15 | bd17b8549 |
hex | 715c8eb65 |
30430260069 has 16 divisors (see below), whose sum is σ = 44610723840. Its totient is φ = 18297362160.
The previous prime is 30430260067. The next prime is 30430260071. The reversal of 30430260069 is 96006203403.
It is an interprime number because it is at equal distance from previous prime (30430260067) and next prime (30430260071).
It is not a de Polignac number, because 30430260069 - 21 = 30430260067 is a prime.
It is a super-2 number, since 2×304302600692 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30430260067) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3626239 + ... + 3634620.
It is an arithmetic number, because the mean of its divisors is an integer number (2788170240).
Almost surely, 230430260069 is an apocalyptic number.
It is an amenable number.
30430260069 is a deficient number, since it is larger than the sum of its proper divisors (14180463771).
30430260069 is a wasteful number, since it uses less digits than its factorization.
30430260069 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7261000.
The product of its (nonzero) digits is 23328, while the sum is 33.
The spelling of 30430260069 in words is "thirty billion, four hundred thirty million, two hundred sixty thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •