Base | Representation |
---|---|
bin | 1111011110000111001110… |
… | …0111000001000110010000 |
3 | 2020020010210211222000002020 |
4 | 3313201303213001012100 |
5 | 4212143000041200422 |
6 | 100102142445451440 |
7 | 3403634623144041 |
oct | 367416347010620 |
9 | 66203724860066 |
10 | 17010010100112 |
11 | 54689a5284777 |
12 | 1aa87a1b70b80 |
13 | 9650635995c3 |
14 | 42b4089968c8 |
15 | 1e770934795c |
hex | f78739c1190 |
17010010100112 has 40 divisors (see below), whose sum is σ = 44662895379840. Its totient is φ = 5577052490880.
The previous prime is 17010010100107. The next prime is 17010010100113. The reversal of 17010010100112 is 21100101001071.
It is a junction number, because it is equal to n+sod(n) for n = 17010010100091 and 17010010100100.
It is not an unprimeable number, because it can be changed into a prime (17010010100113) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2904711912 + ... + 2904717767.
It is an arithmetic number, because the mean of its divisors is an integer number (1116572384496).
Almost surely, 217010010100112 is an apocalyptic number.
17010010100112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
17010010100112 is an abundant number, since it is smaller than the sum of its proper divisors (27652885279728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
17010010100112 is a wasteful number, since it uses less digits than its factorization.
17010010100112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5809429751 (or 5809429745 counting only the distinct ones).
The product of its (nonzero) digits is 14, while the sum is 15.
Adding to 17010010100112 its reverse (21100101001071), we get a palindrome (38110111101183).
The spelling of 17010010100112 in words is "seventeen trillion, ten billion, ten million, one hundred thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •