Base | Representation |
---|---|
bin | 101000010110110… |
… | …010111011110000 |
3 | 1202012000102210110 |
4 | 220112302323300 |
5 | 2341312030212 |
6 | 151103501320 |
7 | 22530644532 |
oct | 5026627360 |
9 | 1665012713 |
10 | 677064432 |
11 | 318204590 |
12 | 16a8b7840 |
13 | aa36ba55 |
14 | 65cc7852 |
15 | 3e691a3c |
hex | 285b2ef0 |
677064432 has 160 divisors (see below), whose sum is σ = 2011299840. Its totient is φ = 194261760.
The previous prime is 677064431. The next prime is 677064467. The reversal of 677064432 is 234460776.
677064432 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (677064431) 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, 1542069 + ... + 1542507.
It is an arithmetic number, because the mean of its divisors is an integer number (12570624).
Almost surely, 2677064432 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 677064432, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1005649920).
677064432 is an abundant number, since it is smaller than the sum of its proper divisors (1334235408).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
677064432 is a wasteful number, since it uses less digits than its factorization.
677064432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 611 (or 605 counting only the distinct ones).
The product of its (nonzero) digits is 169344, while the sum is 39.
The square root of 677064432 is about 26020.4617945186. The cubic root of 677064432 is about 878.0986980922.
The spelling of 677064432 in words is "six hundred seventy-seven million, sixty-four thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •