Base | Representation |
---|---|
bin | 1111101011111… |
… | …0000111100000 |
3 | 11120210111111200 |
4 | 3322332013200 |
5 | 113320243212 |
6 | 10310041200 |
7 | 1426131561 |
oct | 372760740 |
9 | 146714450 |
10 | 65790432 |
11 | 34156364 |
12 | 1a049200 |
13 | 10826766 |
14 | 8a48168 |
15 | 5b986dc |
hex | 3ebe1e0 |
65790432 has 72 divisors (see below), whose sum is σ = 193152960. Its totient is φ = 21219840.
The previous prime is 65790397. The next prime is 65790457. The reversal of 65790432 is 23409756.
It is a tau number, because it is divible by the number of its divisors (72).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 5244 + ... + 12612.
It is an arithmetic number, because the mean of its divisors is an integer number (2682680).
Almost surely, 265790432 is an apocalyptic number.
65790432 is a gapful number since it is divisible by the number (62) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 65790432, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (96576480).
65790432 is an abundant number, since it is smaller than the sum of its proper divisors (127362528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
65790432 is a wasteful number, since it uses less digits than its factorization.
65790432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7416 (or 7405 counting only the distinct ones).
The product of its (nonzero) digits is 45360, while the sum is 36.
The square root of 65790432 is about 8111.1301308757. The cubic root of 65790432 is about 403.6958138965.
The spelling of 65790432 in words is "sixty-five million, seven hundred ninety thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •