Base | Representation |
---|---|
bin | 101001001110101… |
… | …011010001010000 |
3 | 1210012120122222212 |
4 | 221032223101100 |
5 | 2404034304404 |
6 | 152345451252 |
7 | 23066315165 |
oct | 5116532120 |
9 | 1705518885 |
10 | 691713104 |
11 | 3254aa325 |
12 | 1737a0b28 |
13 | b03ca4c4 |
14 | 67c1c06c |
15 | 40ad706e |
hex | 293ab450 |
691713104 has 40 divisors (see below), whose sum is σ = 1390093320. Its totient is φ = 333043200.
The previous prime is 691713097. The next prime is 691713149. The reversal of 691713104 is 401317196.
It can be written as a sum of positive squares in 4 ways, for example, as 23104 + 691690000 = 152^2 + 26300^2 .
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 193574 + ... + 197114.
It is an arithmetic number, because the mean of its divisors is an integer number (34752333).
Almost surely, 2691713104 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 691713104, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (695046660).
691713104 is an abundant number, since it is smaller than the sum of its proper divisors (698380216).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
691713104 is a wasteful number, since it uses less digits than its factorization.
691713104 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3999 (or 3993 counting only the distinct ones).
The product of its (nonzero) digits is 4536, while the sum is 32.
The square root of 691713104 is about 26300.4392358759. The cubic root of 691713104 is about 884.3862892739.
The spelling of 691713104 in words is "six hundred ninety-one million, seven hundred thirteen thousand, one hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •