Base | Representation |
---|---|
bin | 100000010010101011… |
… | …1011011100110000101 |
3 | 20121222212102220101212 |
4 | 1000211113123212011 |
5 | 2114010133013234 |
6 | 51505101301205 |
7 | 5003316320345 |
oct | 1004527334605 |
9 | 217885386355 |
10 | 69346376069 |
11 | 27456248803 |
12 | 11533b64805 |
13 | 6701bc5029 |
14 | 34dbcb0d25 |
15 | 1c0d04e5ce |
hex | 10255db985 |
69346376069 has 2 divisors, whose sum is σ = 69346376070. Its totient is φ = 69346376068.
The previous prime is 69346376053. The next prime is 69346376089. The reversal of 69346376069 is 96067364396.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 65789685025 + 3556691044 = 256495^2 + 59638^2 .
It is a cyclic number.
It is not a de Polignac number, because 69346376069 - 24 = 69346376053 is a prime.
It is a super-2 number, since 2×693463760692 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 69346375999 and 69346376017.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (69346376009) 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, 34673188034 + 34673188035.
It is an arithmetic number, because the mean of its divisors is an integer number (34673188035).
Almost surely, 269346376069 is an apocalyptic number.
It is an amenable number.
69346376069 is a deficient number, since it is larger than the sum of its proper divisors (1).
69346376069 is an equidigital number, since it uses as much as digits as its factorization.
69346376069 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 26453952, while the sum is 59.
The spelling of 69346376069 in words is "sixty-nine billion, three hundred forty-six million, three hundred seventy-six thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •