Base | Representation |
---|---|
bin | 110010000111100… |
… | …0000100100000000 |
3 | 11100012022222102221 |
4 | 1210033000210000 |
5 | 11421000443224 |
6 | 434511420424 |
7 | 56446561234 |
oct | 14417004400 |
9 | 4305288387 |
10 | 1681656064 |
11 | 793284100 |
12 | 3ab224714 |
13 | 20a525b7a |
14 | 11d4ac5c4 |
15 | 9c97d6e4 |
hex | 643c0900 |
1681656064 has 81 divisors (see below), whose sum is σ = 3705546649. Its totient is φ = 761108480.
The previous prime is 1681656061. The next prime is 1681656077. The reversal of 1681656064 is 4606561861.
The square root of 1681656064 is 41008.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 341510400 + 1340145664 = 18480^2 + 36608^2 .
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1681656064.
It is not an unprimeable number, because it can be changed into a prime (1681656061) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 7217292 + ... + 7217524.
Almost surely, 21681656064 is an apocalyptic number.
1681656064 is the 41008-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1681656064
1681656064 is an abundant number, since it is smaller than the sum of its proper divisors (2023890585).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1681656064 is an frugal number, since it uses more digits than its factorization.
1681656064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 504 (or 246 counting only the distinct ones).
The product of its (nonzero) digits is 207360, while the sum is 43.
The cubic root of 1681656064 is about 1189.1748779539.
The spelling of 1681656064 in words is "one billion, six hundred eighty-one million, six hundred fifty-six thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •