Base | Representation |
---|---|
bin | 100000001010111010… |
… | …0011010000100100111 |
3 | 20121022200121212211222 |
4 | 1000111310122010213 |
5 | 2112441344132201 |
6 | 51423142450555 |
7 | 4664001241313 |
oct | 1002564320447 |
9 | 217280555758 |
10 | 69085536551 |
11 | 27331a91159 |
12 | 11480733a5b |
13 | 668cb58915 |
14 | 34b53b2b43 |
15 | 1be51c891b |
hex | 1015d1a127 |
69085536551 has 8 divisors (see below), whose sum is σ = 70562119680. Its totient is φ = 67609231768.
The previous prime is 69085536503. The next prime is 69085536571. The reversal of 69085536551 is 15563558096.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-69085536551 is a prime.
It is a super-2 number, since 2×690855365512 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 69085536493 and 69085536502.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (69085536571) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 477590 + ... + 605196.
It is an arithmetic number, because the mean of its divisors is an integer number (8820264960).
Almost surely, 269085536551 is an apocalyptic number.
69085536551 is a deficient number, since it is larger than the sum of its proper divisors (1476583129).
69085536551 is a wasteful number, since it uses less digits than its factorization.
69085536551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 139173.
The product of its (nonzero) digits is 4860000, while the sum is 53.
The spelling of 69085536551 in words is "sixty-nine billion, eighty-five million, five hundred thirty-six thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •