Base | Representation |
---|---|
bin | 111101010101010010… |
… | …110100101000011001 |
3 | 20021222120202101020201 |
4 | 331111102310220121 |
5 | 2034333002210334 |
6 | 50130440022201 |
7 | 4520650400410 |
oct | 752522645031 |
9 | 207876671221 |
10 | 65855506969 |
11 | 25a2479811a |
12 | 1091aa61961 |
13 | 6296904805 |
14 | 328a40c477 |
15 | 1aa6847c14 |
hex | f554b4a19 |
65855506969 has 8 divisors (see below), whose sum is σ = 76170225600. Its totient is φ = 55767485616.
The previous prime is 65855506963. The next prime is 65855506991. The reversal of 65855506969 is 96960555856.
65855506969 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 65855506969 - 27 = 65855506841 is a prime.
It is a super-2 number, since 2×658555069692 (a number of 22 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 65855506969.
It is not an unprimeable number, because it can be changed into a prime (65855506963) 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, 56673694 + ... + 56674855.
It is an arithmetic number, because the mean of its divisors is an integer number (9521278200).
Almost surely, 265855506969 is an apocalyptic number.
It is an amenable number.
65855506969 is a deficient number, since it is larger than the sum of its proper divisors (10314718631).
65855506969 is a wasteful number, since it uses less digits than its factorization.
65855506969 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 113348639.
The product of its (nonzero) digits is 87480000, while the sum is 64.
The spelling of 65855506969 in words is "sixty-five billion, eight hundred fifty-five million, five hundred six thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.257 sec. • engine limits •