Base | Representation |
---|---|
bin | 1011111011100110… |
… | …11000110000110000 |
3 | 121112102020200122110 |
4 | 11331303120300300 |
5 | 101104312340224 |
6 | 2535342005320 |
7 | 314510421456 |
oct | 57563306060 |
9 | 17472220573 |
10 | 6405590064 |
11 | 2797874695 |
12 | 12a9276840 |
13 | 7b11168a3 |
14 | 44aa2a9d6 |
15 | 277552929 |
hex | 17dcd8c30 |
6405590064 has 80 divisors (see below), whose sum is σ = 17536065120. Its totient is φ = 2011269120.
The previous prime is 6405590041. The next prime is 6405590069. The reversal of 6405590064 is 4600955046.
It is not an unprimeable number, because it can be changed into a prime (6405590069) 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 15 ways as a sum of consecutive naturals, for example, 954 + ... + 113190.
It is an arithmetic number, because the mean of its divisors is an integer number (219200814).
Almost surely, 26405590064 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 6405590064, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (8768032560).
6405590064 is an abundant number, since it is smaller than the sum of its proper divisors (11130475056).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6405590064 is a wasteful number, since it uses less digits than its factorization.
6405590064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 112318 (or 112312 counting only the distinct ones).
The product of its (nonzero) digits is 129600, while the sum is 39.
The square root of 6405590064 is about 80034.9302742246. The cubic root of 6405590064 is about 1857.1759340268.
The spelling of 6405590064 in words is "six billion, four hundred five million, five hundred ninety thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •