Base | Representation |
---|---|
bin | 10000000001111110… |
… | …111010111100010001 |
3 | 1122102121120011001121 |
4 | 100001332322330101 |
5 | 240223031001003 |
6 | 11524013202241 |
7 | 1146362165554 |
oct | 200176727421 |
9 | 48377504047 |
10 | 17213140753 |
11 | 7333407466 |
12 | 3404790381 |
13 | 18141cb9b3 |
14 | b9412269b |
15 | 6ab279cbd |
hex | 401fbaf11 |
17213140753 has 8 divisors (see below), whose sum is σ = 17351920872. Its totient is φ = 17074880256.
The previous prime is 17213140717. The next prime is 17213140829. The reversal of 17213140753 is 35704131271.
It can be written as a sum of positive squares in 4 ways, for example, as 11544857809 + 5668282944 = 107447^2 + 75288^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-17213140753 is a prime.
It is a super-3 number, since 3×172131407533 (a number of 32 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (17213140253) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 63250 + ... + 196027.
It is an arithmetic number, because the mean of its divisors is an integer number (2168990109).
Almost surely, 217213140753 is an apocalyptic number.
It is an amenable number.
17213140753 is a deficient number, since it is larger than the sum of its proper divisors (138780119).
17213140753 is a wasteful number, since it uses less digits than its factorization.
17213140753 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 259811.
The product of its (nonzero) digits is 17640, while the sum is 34.
The spelling of 17213140753 in words is "seventeen billion, two hundred thirteen million, one hundred forty thousand, seven hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •