Base | Representation |
---|---|
bin | 101000100010101… |
… | …000010000000000 |
3 | 1202101212000220011 |
4 | 220202220100000 |
5 | 2343110311100 |
6 | 151254154304 |
7 | 22566214264 |
oct | 5042502000 |
9 | 1671760804 |
10 | 680166400 |
11 | 319a330a1 |
12 | 16b952994 |
13 | aabb6934 |
14 | 664940a4 |
15 | 3eaa5bba |
hex | 288a8400 |
680166400 has 99 divisors (see below), whose sum is σ = 1696395981. Its totient is φ = 270397440.
The previous prime is 680166367. The next prime is 680166433. The reversal of 680166400 is 4661086.
The square root of 680166400 is 26080.
It is a perfect power (a square), and thus also a powerful number.
It is an interprime number because it is at equal distance from previous prime (680166367) and next prime (680166433).
It can be written as a sum of positive squares in only one way, i.e., 244859904 + 435306496 = 15648^2 + 20864^2 .
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 4172719 + ... + 4172881.
Almost surely, 2680166400 is an apocalyptic number.
680166400 is the 26080-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 680166400
680166400 is an abundant number, since it is smaller than the sum of its proper divisors (1016229581).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
680166400 is an equidigital number, since it uses as much as digits as its factorization.
680166400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 356 (or 170 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 31.
The cubic root of 680166400 is about 879.4376572539.
The spelling of 680166400 in words is "six hundred eighty million, one hundred sixty-six thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •