Base | Representation |
---|---|
bin | 101000100111100… |
… | …101111001111010 |
3 | 1202111022010200120 |
4 | 220213211321322 |
5 | 2343423430024 |
6 | 151342114110 |
7 | 22613243520 |
oct | 5047457172 |
9 | 1674263616 |
10 | 681467514 |
11 | 31a7416a2 |
12 | 17027b936 |
13 | ab250c20 |
14 | 66712310 |
15 | 3ec61479 |
hex | 289e5e7a |
681467514 has 64 divisors (see below), whose sum is σ = 1701181440. Its totient is φ = 177186240.
The previous prime is 681467497. The next prime is 681467531. The reversal of 681467514 is 415764186.
It is an interprime number because it is at equal distance from previous prime (681467497) and next prime (681467531).
It is a Harshad number since it is a multiple of its sum of digits (42).
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 31 ways as a sum of consecutive naturals, for example, 29977 + ... + 47555.
It is an arithmetic number, because the mean of its divisors is an integer number (26580960).
Almost surely, 2681467514 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 681467514, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (850590720).
681467514 is an abundant number, since it is smaller than the sum of its proper divisors (1019713926).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
681467514 is a wasteful number, since it uses less digits than its factorization.
681467514 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17675.
The product of its digits is 161280, while the sum is 42.
The square root of 681467514 is about 26104.9327522597. The cubic root of 681467514 is about 879.9980690385.
The spelling of 681467514 in words is "six hundred eighty-one million, four hundred sixty-seven thousand, five hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •