Base | Representation |
---|---|
bin | 100111010010101011… |
… | …0011110101011000101 |
3 | 22001210111001112101122 |
4 | 1032211112132223011 |
5 | 2340301344341234 |
6 | 102432444203325 |
7 | 6044656342625 |
oct | 1164526365305 |
9 | 261714045348 |
10 | 84378512069 |
11 | 3286a519aa5 |
12 | 1442a239545 |
13 | 7c592b3367 |
14 | 412649c885 |
15 | 22dcab092e |
hex | 13a559eac5 |
84378512069 has 2 divisors, whose sum is σ = 84378512070. Its totient is φ = 84378512068.
The previous prime is 84378512021. The next prime is 84378512081. The reversal of 84378512069 is 96021587348.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 67592200225 + 16786311844 = 259985^2 + 129562^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-84378512069 is a prime.
It is a super-2 number, since 2×843785120692 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 84378512069.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (84378515069) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 42189256034 + 42189256035.
It is an arithmetic number, because the mean of its divisors is an integer number (42189256035).
It is a 1-persistent number, because it is pandigital, but 2⋅84378512069 = 168757024138 is not.
Almost surely, 284378512069 is an apocalyptic number.
It is an amenable number.
84378512069 is a deficient number, since it is larger than the sum of its proper divisors (1).
84378512069 is an equidigital number, since it uses as much as digits as its factorization.
84378512069 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2903040, while the sum is 53.
The spelling of 84378512069 in words is "eighty-four billion, three hundred seventy-eight million, five hundred twelve thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •