Base | Representation |
---|---|
bin | 101000110011110… |
… | …100101110110000 |
3 | 1202201100001010010 |
4 | 220303310232300 |
5 | 2400234031333 |
6 | 151534534520 |
7 | 22652430006 |
oct | 5063645660 |
9 | 1681301103 |
10 | 684673968 |
11 | 321531760 |
12 | 171367440 |
13 | abb04534 |
14 | 66d08a76 |
15 | 40196563 |
hex | 28cf4bb0 |
684673968 has 160 divisors (see below), whose sum is σ = 2049868800. Its totient is φ = 194745600.
The previous prime is 684673939. The next prime is 684673999. The reversal of 684673968 is 869376486.
It is a happy number.
684673968 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (57).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1394203 + ... + 1394693.
It is an arithmetic number, because the mean of its divisors is an integer number (12811680).
Almost surely, 2684673968 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 684673968, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1024934400).
684673968 is an abundant number, since it is smaller than the sum of its proper divisors (1365194832).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
684673968 is a wasteful number, since it uses less digits than its factorization.
684673968 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 671 (or 665 counting only the distinct ones).
The product of its digits is 10450944, while the sum is 57.
The square root of 684673968 is about 26166.2753941022. The cubic root of 684673968 is about 881.3761045634.
The spelling of 684673968 in words is "six hundred eighty-four million, six hundred seventy-three thousand, nine hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •