Base | Representation |
---|---|
bin | 11111110000110000… |
… | …11000010110000110 |
3 | 1122000101102111222110 |
4 | 33320120120112012 |
5 | 234410310331010 |
6 | 11500020241450 |
7 | 1142364654000 |
oct | 177030302606 |
9 | 48011374873 |
10 | 17052042630 |
11 | 7260485017 |
12 | 337a840286 |
13 | 17b9a1546c |
14 | b7a989370 |
15 | 69c057120 |
hex | 3f8618586 |
17052042630 has 128 divisors (see below), whose sum is σ = 49372416000. Its totient is φ = 3763143552.
The previous prime is 17052042569. The next prime is 17052042647. The reversal of 17052042630 is 3624025071.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 269839 + ... + 326981.
It is an arithmetic number, because the mean of its divisors is an integer number (385722000).
Almost surely, 217052042630 is an apocalyptic number.
17052042630 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 17052042630, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (24686208000).
17052042630 is an abundant number, since it is smaller than the sum of its proper divisors (32320373370).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
17052042630 is a wasteful number, since it uses less digits than its factorization.
17052042630 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 57203 (or 57189 counting only the distinct ones).
The product of its (nonzero) digits is 10080, while the sum is 30.
It can be divided in two parts, 170520 and 42630, that multiplied together give a square (7269267600 = 852602).
The spelling of 17052042630 in words is "seventeen billion, fifty-two million, forty-two thousand, six hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •