Base | Representation |
---|---|
bin | 101000100111101… |
… | …111101110100110 |
3 | 1202111101011212210 |
4 | 220213233232212 |
5 | 2343431222000 |
6 | 151343024250 |
7 | 22613502030 |
oct | 5047575646 |
9 | 1674334783 |
10 | 681507750 |
11 | 31a769950 |
12 | 17029b086 |
13 | ab266331 |
14 | 66722c50 |
15 | 3ec6d350 |
hex | 289efba6 |
681507750 has 128 divisors (see below), whose sum is σ = 2120961024. Its totient is φ = 141600000.
The previous prime is 681507737. The next prime is 681507787. The reversal of 681507750 is 57705186.
681507750 is digitally balanced in base 6, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 681507699 and 681507708.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 51850 + ... + 63650.
It is an arithmetic number, because the mean of its divisors is an integer number (16570008).
Almost surely, 2681507750 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 681507750, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1060480512).
681507750 is an abundant number, since it is smaller than the sum of its proper divisors (1439453274).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
681507750 is a wasteful number, since it uses less digits than its factorization.
681507750 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11839 (or 11829 counting only the distinct ones).
The product of its (nonzero) digits is 58800, while the sum is 39.
The square root of 681507750 is about 26105.7033998320. The cubic root of 681507750 is about 880.0153879885.
The spelling of 681507750 in words is "six hundred eighty-one million, five hundred seven thousand, seven hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •