Base | Representation |
---|---|
bin | 10011110010101011110… |
… | …10000010110100000000 |
3 | 2102000022120201212021001 |
4 | 21321111322002310000 |
5 | 42120213301041000 |
6 | 1240224152141344 |
7 | 100063114401643 |
oct | 11712572026400 |
9 | 2360276655231 |
10 | 680046112000 |
11 | 242451335272 |
12 | ab96a097854 |
13 | 4c1884b8b18 |
14 | 24cb31c3a5a |
15 | 12a523e946a |
hex | 9e55e82d00 |
680046112000 has 72 divisors (see below), whose sum is σ = 1694079950472. Its totient is φ = 272018432000.
The previous prime is 680046111971. The next prime is 680046112021. The reversal of 680046112000 is 211640086.
It can be written as a sum of positive squares in 4 ways, for example, as 41370624 + 680004741376 = 6432^2 + 824624^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 680046112000.
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 7 ways as a sum of consecutive naturals, for example, 10593721 + ... + 10657720.
It is an arithmetic number, because the mean of its divisors is an integer number (23528888201).
Almost surely, 2680046112000 is an apocalyptic number.
It is an amenable number.
680046112000 is an abundant number, since it is smaller than the sum of its proper divisors (1014033838472).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
680046112000 is an equidigital number, since it uses as much as digits as its factorization.
680046112000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21251472 (or 21251448 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 28.
Adding to 680046112000 its reverse (211640086), we get a palindrome (680257752086).
The spelling of 680046112000 in words is "six hundred eighty billion, forty-six million, one hundred twelve thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •