Base | Representation |
---|---|
bin | 1111011000001… |
… | …0000101101100 |
3 | 11111100201212000 |
4 | 3312002011230 |
5 | 113002332410 |
6 | 10222212300 |
7 | 1412130633 |
oct | 366020554 |
9 | 144321760 |
10 | 64495980 |
11 | 3345186a |
12 | 19724090 |
13 | 10492503 |
14 | 87cc51a |
15 | 59dedc0 |
hex | 3d8216c |
64495980 has 96 divisors (see below), whose sum is σ = 203212800. Its totient is φ = 16979904.
The previous prime is 64495967. The next prime is 64495987. The reversal of 64495980 is 8959446.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is not an unprimeable number, because it can be changed into a prime (64495987) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 44101 + ... + 45539.
It is an arithmetic number, because the mean of its divisors is an integer number (2116800).
Almost surely, 264495980 is an apocalyptic number.
64495980 is a gapful number since it is divisible by the number (60) 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 64495980, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (101606400).
64495980 is an abundant number, since it is smaller than the sum of its proper divisors (138716820).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
64495980 is a wasteful number, since it uses less digits than its factorization.
64495980 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1540 (or 1532 counting only the distinct ones).
The product of its (nonzero) digits is 311040, while the sum is 45.
The square root of 64495980 is about 8030.9389239366. The cubic root of 64495980 is about 401.0306338705.
The spelling of 64495980 in words is "sixty-four million, four hundred ninety-five thousand, nine hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •