Base | Representation |
---|---|
bin | 1101101001101100101000… |
… | …00010000100011010010101 |
3 | 10221021212220010001011222212 |
4 | 12310312110002010122111 |
5 | 12413321440030031234 |
6 | 143503000251003205 |
7 | 6215605555531523 |
oct | 664662402043225 |
9 | 127255803034885 |
10 | 30020010002069 |
11 | 962446203184a |
12 | 344a0b4739505 |
13 | 1399b4ac09669 |
14 | 75ad94b17313 |
15 | 370d5186d5ce |
hex | 1b4d94084695 |
30020010002069 has 2 divisors, whose sum is σ = 30020010002070. Its totient is φ = 30020010002068.
The previous prime is 30020010002033. The next prime is 30020010002119. The reversal of 30020010002069 is 96020001002003.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 23606139718225 + 6413870283844 = 4858615^2 + 2532562^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-30020010002069 is a prime.
It is a super-2 number, since 2×300200100020692 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30020010022069) 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 as a sum of consecutive naturals, namely, 15010005001034 + 15010005001035.
It is an arithmetic number, because the mean of its divisors is an integer number (15010005001035).
Almost surely, 230020010002069 is an apocalyptic number.
It is an amenable number.
30020010002069 is a deficient number, since it is larger than the sum of its proper divisors (1).
30020010002069 is an equidigital number, since it uses as much as digits as its factorization.
30020010002069 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648, while the sum is 23.
The spelling of 30020010002069 in words is "thirty trillion, twenty billion, ten million, two thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •