Base | Representation |
---|---|
bin | 101001000101011… |
… | …111100111110100 |
3 | 1210001001101012120 |
4 | 221011133213310 |
5 | 2402430243400 |
6 | 152222115540 |
7 | 23040001530 |
oct | 5105374764 |
9 | 1701041176 |
10 | 689306100 |
11 | 32410596a |
12 | 172a1bbb0 |
13 | aca66a42 |
14 | 67792bc0 |
15 | 407adca0 |
hex | 2915f9f4 |
689306100 has 144 divisors (see below), whose sum is σ = 2317101696. Its totient is φ = 154944000.
The previous prime is 689306087. The next prime is 689306171. The reversal of 689306100 is 1603986.
It is a congruent number.
It is an unprimeable number.
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 47 ways as a sum of consecutive naturals, for example, 125410 + ... + 130790.
It is an arithmetic number, because the mean of its divisors is an integer number (16090984).
Almost surely, 2689306100 is an apocalyptic number.
689306100 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 689306100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1158550848).
689306100 is an abundant number, since it is smaller than the sum of its proper divisors (1627795596).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
689306100 is a wasteful number, since it uses less digits than its factorization.
689306100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5466 (or 5459 counting only the distinct ones).
The product of its (nonzero) digits is 7776, while the sum is 33.
The square root of 689306100 is about 26254.6395899849. The cubic root of 689306100 is about 883.3592761654.
The spelling of 689306100 in words is "six hundred eighty-nine million, three hundred six thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •