Base | Representation |
---|---|
bin | 1111101111000… |
… | …0101010010000 |
3 | 11121012000111020 |
4 | 3323300222100 |
5 | 113343404311 |
6 | 10314315440 |
7 | 1430653260 |
oct | 373605220 |
9 | 147160436 |
10 | 65997456 |
11 | 34287958 |
12 | 1a128b80 |
13 | 10899a65 |
14 | 8a9d7a0 |
15 | 5bd9c06 |
hex | 3ef0a90 |
65997456 has 80 divisors (see below), whose sum is σ = 196844544. Its totient is φ = 18663552.
The previous prime is 65997439. The next prime is 65997457. The reversal of 65997456 is 65479956.
65997456 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 65997399 and 65997408.
It is not an unprimeable number, because it can be changed into a prime (65997457) 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 15 ways as a sum of consecutive naturals, for example, 33655 + ... + 35561.
Almost surely, 265997456 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 65997456, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (98422272).
65997456 is an abundant number, since it is smaller than the sum of its proper divisors (130847088).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
65997456 is a wasteful number, since it uses less digits than its factorization.
65997456 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2028 (or 2022 counting only the distinct ones).
The product of its digits is 2041200, while the sum is 51.
The square root of 65997456 is about 8123.8818307506. The cubic root of 65997456 is about 404.1188096144.
The spelling of 65997456 in words is "sixty-five million, nine hundred ninety-seven thousand, four hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.029 sec. • engine limits •