Base | Representation |
---|---|
bin | 10011110100111011110… |
… | …10110001001101100000 |
3 | 2102010102210002012221112 |
4 | 21322131322301031200 |
5 | 42130202042332400 |
6 | 1240544111042452 |
7 | 100135054451663 |
oct | 11723572611540 |
9 | 2363383065845 |
10 | 681254261600 |
11 | 242a112a7a10 |
12 | b0046810428 |
13 | 4c31b8a4843 |
14 | 24d898356da |
15 | 12ac34e4835 |
hex | 9e9deb1360 |
681254261600 has 288 divisors, whose sum is σ = 1890115274880. Its totient is φ = 237582848000.
The previous prime is 681254261593. The next prime is 681254261669. The reversal of 681254261600 is 6162452186.
It is a super-2 number, since 2×6812542616002 (a number of 24 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (41).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 21271199 + ... + 21303201.
It is an arithmetic number, because the mean of its divisors is an integer number (6562900260).
Almost surely, 2681254261600 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 681254261600, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (945057637440).
681254261600 is an abundant number, since it is smaller than the sum of its proper divisors (1208861013280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
681254261600 is a wasteful number, since it uses less digits than its factorization.
681254261600 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32134 (or 32121 counting only the distinct ones).
The product of its (nonzero) digits is 138240, while the sum is 41.
The spelling of 681254261600 in words is "six hundred eighty-one billion, two hundred fifty-four million, two hundred sixty-one thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •