Base | Representation |
---|---|
bin | 101000100110100… |
… | …111111100110000 |
3 | 1202110211020120200 |
4 | 220212213330300 |
5 | 2343342314434 |
6 | 151332435200 |
7 | 22611135621 |
oct | 5046477460 |
9 | 1673736520 |
10 | 681213744 |
11 | 31a588a72 |
12 | 170178b00 |
13 | ab192573 |
14 | 66687a48 |
15 | 3ec11199 |
hex | 289a7f30 |
681213744 has 60 divisors (see below), whose sum is σ = 1912086696. Its totient is φ = 226400256.
The previous prime is 681213721. The next prime is 681213763. The reversal of 681213744 is 447312186.
681213744 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 681213699 and 681213708.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 43152 + ... + 56784.
Almost surely, 2681213744 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 681213744, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (956043348).
681213744 is an abundant number, since it is smaller than the sum of its proper divisors (1230872952).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
681213744 is a wasteful number, since it uses less digits than its factorization.
681213744 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13994 (or 13985 counting only the distinct ones).
The product of its digits is 32256, while the sum is 36.
The square root of 681213744 is about 26100.0717240394. The cubic root of 681213744 is about 879.8888220427. Note that the first 4 decimals are identical.
The spelling of 681213744 in words is "six hundred eighty-one million, two hundred thirteen thousand, seven hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •