Base | Representation |
---|---|
bin | 11111110100011001… |
… | …00001110010010000 |
3 | 1122002111201101220211 |
4 | 33322030201302100 |
5 | 234441104140000 |
6 | 11503025013504 |
7 | 1143214524562 |
oct | 177214416220 |
9 | 48074641824 |
10 | 17082490000 |
11 | 7276690634 |
12 | 3388a84294 |
13 | 17c3115c64 |
14 | b80a33332 |
15 | 69ea6d7ba |
hex | 3fa321c90 |
17082490000 has 75 divisors (see below), whose sum is σ = 41390084527. Its totient is φ = 6827768000.
The previous prime is 17082489913. The next prime is 17082490027. The reversal of 17082490000 is 9428071.
The square root of 17082490000 is 130700.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 2 ways, for example, as 1339267216 + 15743222784 = 36596^2 + 125472^2 .
It is a super-2 number, since 2×170824900002 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 14 ways as a sum of consecutive naturals, for example, 13069347 + ... + 13070653.
Almost surely, 217082490000 is an apocalyptic number.
17082490000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
17082490000 is the 130700-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 17082490000
17082490000 is an abundant number, since it is smaller than the sum of its proper divisors (24307594527).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
17082490000 is an frugal number, since it uses more digits than its factorization.
17082490000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2642 (or 1314 counting only the distinct ones).
The product of its (nonzero) digits is 4032, while the sum is 31.
The spelling of 17082490000 in words is "seventeen billion, eighty-two million, four hundred ninety thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •