Base | Representation |
---|---|
bin | 1111100111001… |
… | …1010011101100 |
3 | 11120012221011210 |
4 | 3321303103230 |
5 | 113230442022 |
6 | 10255314420 |
7 | 1423414326 |
oct | 371632354 |
9 | 146187153 |
10 | 65484012 |
11 | 33a67120 |
12 | 19b1ba10 |
13 | 1074a149 |
14 | 89a8616 |
15 | 5b37a0c |
hex | 3e734ec |
65484012 has 96 divisors (see below), whose sum is σ = 173859840. Its totient is φ = 19010880.
The previous prime is 65483953. The next prime is 65484031. The reversal of 65484012 is 21048456.
It is a super-2 number, since 2×654840122 = 8576311655232288, which contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 471039 + ... + 471177.
It is an arithmetic number, because the mean of its divisors is an integer number (1811040).
Almost surely, 265484012 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 65484012, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (86929920).
65484012 is an abundant number, since it is smaller than the sum of its proper divisors (108375828).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
65484012 is a wasteful number, since it uses less digits than its factorization.
65484012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 283 (or 281 counting only the distinct ones).
The product of its (nonzero) digits is 7680, while the sum is 30.
The square root of 65484012 is about 8092.2192258984. The cubic root of 65484012 is about 403.0680984286.
Subtracting from 65484012 its reverse (21048456), we obtain a square (44435556 = 66662).
It can be divided in two parts, 654 and 84012, that added together give a triangular number (84666 = T411).
The spelling of 65484012 in words is "sixty-five million, four hundred eighty-four thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •