Base | Representation |
---|---|
bin | 110010110111001… |
… | …1110010000000000 |
3 | 11101221102101200011 |
4 | 1211232132100000 |
5 | 11443402300334 |
6 | 441204034304 |
7 | 60202360234 |
oct | 14556362000 |
9 | 4357371604 |
10 | 1706681344 |
11 | 7a6416a55 |
12 | 3b7692994 |
13 | 212778724 |
14 | 1229445c4 |
15 | 9ec73564 |
hex | 65b9e400 |
1706681344 has 33 divisors (see below), whose sum is σ = 3414340731. Its totient is φ = 852679680.
The previous prime is 1706681287. The next prime is 1706681359. The reversal of 1706681344 is 4431866071.
The square root of 1706681344 is 41312.
It is a perfect power (a square), and thus also a powerful number.
It is a super-2 number, since 2×17066813442 = 5825522419915292672, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1706681297 and 1706681306.
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 2 ways as a sum of consecutive naturals, for example, 1321339 + ... + 1322629.
Almost surely, 21706681344 is an apocalyptic number.
1706681344 is the 41312-nd square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1706681344
1706681344 is an abundant number, since it is smaller than the sum of its proper divisors (1707659387).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1706681344 is an frugal number, since it uses more digits than its factorization.
1706681344 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2602 (or 1293 counting only the distinct ones).
The product of its (nonzero) digits is 96768, while the sum is 40.
The cubic root of 1706681344 is about 1195.0446915237.
The spelling of 1706681344 in words is "one billion, seven hundred six million, six hundred eighty-one thousand, three hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •