Base | Representation |
---|---|
bin | 1111011111010… |
… | …1111101001000 |
3 | 11112020211212100 |
4 | 3313311331020 |
5 | 113113024233 |
6 | 10240313400 |
7 | 1416145365 |
oct | 367657510 |
9 | 145224770 |
10 | 64970568 |
11 | 33746393 |
12 | 19912860 |
13 | 105ca530 |
14 | 88b346c |
15 | 5a85813 |
hex | 3df5f48 |
64970568 has 96 divisors (see below), whose sum is σ = 194234040. Its totient is φ = 19491840.
The previous prime is 64970537. The next prime is 64970569. The reversal of 64970568 is 86507946.
It can be written as a sum of positive squares in 4 ways, for example, as 23213124 + 41757444 = 4818^2 + 6462^2 .
It is not an unprimeable number, because it can be changed into a prime (64970569) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 37530 + ... + 39222.
Almost surely, 264970568 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 64970568, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (97117020).
64970568 is an abundant number, since it is smaller than the sum of its proper divisors (129263472).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
64970568 is a wasteful number, since it uses less digits than its factorization.
64970568 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1759 (or 1752 counting only the distinct ones).
The product of its (nonzero) digits is 362880, while the sum is 45.
The square root of 64970568 is about 8060.4322464741. The cubic root of 64970568 is about 402.0118805429.
It can be divided in two parts, 649 and 70568, that added together give a palindrome (71217).
The spelling of 64970568 in words is "sixty-four million, nine hundred seventy thousand, five hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •