Base | Representation |
---|---|
bin | 11111101010101011… |
… | …01111111110000000 |
3 | 1121212211102100220000 |
4 | 33311111233332000 |
5 | 234304230140222 |
6 | 11450554520000 |
7 | 1141205203542 |
oct | 176525577600 |
9 | 47784370800 |
10 | 17001021312 |
11 | 72346a6a40 |
12 | 3365736000 |
13 | 17ac290232 |
14 | b73ca7692 |
15 | 6978299ac |
hex | 3f556ff80 |
17001021312 has 160 divisors (see below), whose sum is σ = 55194658200. Its totient is φ = 5151790080.
The previous prime is 17001021307. The next prime is 17001021313. The reversal of 17001021312 is 21312010071.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (17001021313) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 39514 + ... + 188582.
Almost surely, 217001021312 is an apocalyptic number.
17001021312 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 17001021312, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (27597329100).
17001021312 is an abundant number, since it is smaller than the sum of its proper divisors (38193636888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
17001021312 is a wasteful number, since it uses less digits than its factorization.
17001021312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 149106 (or 149085 counting only the distinct ones).
The product of its (nonzero) digits is 84, while the sum is 18.
Adding to 17001021312 its reverse (21312010071), we get a palindrome (38313031383).
The spelling of 17001021312 in words is "seventeen billion, one million, twenty-one thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •