Base | Representation |
---|---|
bin | 1111101100111… |
… | …0001000001100 |
3 | 11120220211110120 |
4 | 3323032020030 |
5 | 113324343022 |
6 | 10311304540 |
7 | 1426524015 |
oct | 373161014 |
9 | 146824416 |
10 | 65856012 |
11 | 341a0662 |
12 | 1a07b150 |
13 | 1084a571 |
14 | 8a6400c |
15 | 5bacd5c |
hex | 3ece20c |
65856012 has 12 divisors (see below), whose sum is σ = 153664056. Its totient is φ = 21952000.
The previous prime is 65855987. The next prime is 65856017. The reversal of 65856012 is 21065856.
65856012 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (12).
It is a Smith number, since the sum of its digits (33) coincides with the sum of the digits of its prime factors.
It is not an unprimeable number, because it can be changed into a prime (65856017) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2743989 + ... + 2744012.
It is an arithmetic number, because the mean of its divisors is an integer number (12805338).
Almost surely, 265856012 is an apocalyptic number.
It is an amenable number.
65856012 is an abundant number, since it is smaller than the sum of its proper divisors (87808044).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
65856012 is a wasteful number, since it uses less digits than its factorization.
65856012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5488008 (or 5488006 counting only the distinct ones).
The product of its (nonzero) digits is 14400, while the sum is 33.
The square root of 65856012 is about 8115.1717172220. The cubic root of 65856012 is about 403.8299042141.
The spelling of 65856012 in words is "sixty-five million, eight hundred fifty-six thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •