Base | Representation |
---|---|
bin | 100000001000110101… |
… | …1110110000101011101 |
3 | 20121010212010100211212 |
4 | 1000101223312011131 |
5 | 2112321120330013 |
6 | 51412224154205 |
7 | 4662166606622 |
oct | 1002153660535 |
9 | 217125110755 |
10 | 69016183133 |
11 | 272a6921987 |
12 | 11461468965 |
13 | 667b6854b1 |
14 | 34aa0bc349 |
15 | 1bde0796a8 |
hex | 1011af615d |
69016183133 has 2 divisors, whose sum is σ = 69016183134. Its totient is φ = 69016183132.
The previous prime is 69016183121. The next prime is 69016183147. The reversal of 69016183133 is 33138161096.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 36481764004 + 32534419129 = 191002^2 + 180373^2 .
It is a cyclic number.
It is not a de Polignac number, because 69016183133 - 28 = 69016182877 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (69016180133) 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 as a sum of consecutive naturals, namely, 34508091566 + 34508091567.
It is an arithmetic number, because the mean of its divisors is an integer number (34508091567).
Almost surely, 269016183133 is an apocalyptic number.
It is an amenable number.
69016183133 is a deficient number, since it is larger than the sum of its proper divisors (1).
69016183133 is an equidigital number, since it uses as much as digits as its factorization.
69016183133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 69984, while the sum is 41.
The spelling of 69016183133 in words is "sixty-nine billion, sixteen million, one hundred eighty-three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •