Base | Representation |
---|---|
bin | 11111110010001101… |
… | …01111101100100100 |
3 | 1122001020022000111121 |
4 | 33321012233230210 |
5 | 234421413300100 |
6 | 11501132543324 |
7 | 1142603165122 |
oct | 177106575444 |
9 | 48036260447 |
10 | 17064196900 |
11 | 7267326773 |
12 | 3382921b44 |
13 | 17bc3ac73a |
14 | b7c430912 |
15 | 69d15851a |
hex | 3f91afb24 |
17064196900 has 27 divisors (see below), whose sum is σ = 37032142161. Its totient is φ = 6825156240.
The previous prime is 17064196889. The next prime is 17064196921. The reversal of 17064196900 is 969146071.
It is a happy number.
The square root of 17064196900 is 130630.
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., 6143110884 + 10921086016 = 78378^2 + 104504^2 .
It is a super-2 number, since 2×170641969002 (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 8 ways as a sum of consecutive naturals, for example, 1299769 + ... + 1312831.
Almost surely, 217064196900 is an apocalyptic number.
17064196900 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
17064196900 is the 130630-th square number.
It is an amenable number.
17064196900 is an abundant number, since it is smaller than the sum of its proper divisors (19967945261).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
17064196900 is an frugal number, since it uses more digits than its factorization.
17064196900 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 26140 (or 13070 counting only the distinct ones).
The product of its (nonzero) digits is 81648, while the sum is 43.
The spelling of 17064196900 in words is "seventeen billion, sixty-four million, one hundred ninety-six thousand, nine hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •