Base | Representation |
---|---|
bin | 101000100110110… |
… | …010111101110000 |
3 | 1202110220112110210 |
4 | 220212302331300 |
5 | 2343400240424 |
6 | 151333424120 |
7 | 22611414306 |
oct | 5046627560 |
9 | 1673815423 |
10 | 681258864 |
11 | 31a609960 |
12 | 17019b040 |
13 | ab1a9c70 |
14 | 6669a276 |
15 | 3ec1e729 |
hex | 289b2f70 |
681258864 has 80 divisors (see below), whose sum is σ = 2067617664. Its totient is φ = 190560000.
The previous prime is 681258859. The next prime is 681258869. The reversal of 681258864 is 468852186.
It is a happy number.
681258864 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (681258859) and next prime (681258869).
It is a super-2 number, since 2×6812588642 = 928227279557140992, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (681258869) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 42762 + ... + 56489.
Almost surely, 2681258864 is an apocalyptic number.
It is an amenable number.
681258864 is an abundant number, since it is smaller than the sum of its proper divisors (1386358800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
681258864 is a wasteful number, since it uses less digits than its factorization.
681258864 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 99286 (or 99280 counting only the distinct ones).
The product of its digits is 737280, while the sum is 48.
The square root of 681258864 is about 26100.9360751679. The cubic root of 681258864 is about 879.9082480097.
The spelling of 681258864 in words is "six hundred eighty-one million, two hundred fifty-eight thousand, eight hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •