Base | Representation |
---|---|
bin | 101000100110101… |
… | …010110110100000 |
3 | 1202110211211212222 |
4 | 220212222312200 |
5 | 2343343210012 |
6 | 151333010212 |
7 | 22611215363 |
oct | 5046526640 |
9 | 1673754788 |
10 | 681225632 |
11 | 31a59699a |
12 | 170183968 |
13 | ab197ab9 |
14 | 6668c0da |
15 | 3ec14972 |
hex | 289aada0 |
681225632 has 48 divisors (see below), whose sum is σ = 1425029760. Its totient is φ = 319454208.
The previous prime is 681225607. The next prime is 681225641. The reversal of 681225632 is 236522186.
It is a junction number, because it is equal to n+sod(n) for n = 681225592 and 681225601.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 164969 + ... + 169047.
It is an arithmetic number, because the mean of its divisors is an integer number (29688120).
Almost surely, 2681225632 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 681225632, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (712514880).
681225632 is an abundant number, since it is smaller than the sum of its proper divisors (743804128).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
681225632 is a wasteful number, since it uses less digits than its factorization.
681225632 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4413 (or 4405 counting only the distinct ones).
The product of its digits is 34560, while the sum is 35.
The square root of 681225632 is about 26100.2994618836. The cubic root of 681225632 is about 879.8939403860.
The spelling of 681225632 in words is "six hundred eighty-one million, two hundred twenty-five thousand, six hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •