Base | Representation |
---|---|
bin | 1000000010001110011011… |
… | …00000011010010011101101 |
3 | 2022120002212110221222002110 |
4 | 10001013031200122103231 |
5 | 4303440342432022333 |
6 | 101324510500314233 |
7 | 3502342401453120 |
oct | 401071540322355 |
9 | 68502773858073 |
10 | 17668648314093 |
11 | 56a2260397337 |
12 | 1b943766a2979 |
13 | 9b21b97c513a |
14 | 45124a8c83b7 |
15 | 2099070c1063 |
hex | 1011cd81a4ed |
17668648314093 has 16 divisors (see below), whose sum is σ = 26927096426496. Its totient is φ = 10095079770480.
The previous prime is 17668648314047. The next prime is 17668648314113. The reversal of 17668648314093 is 39041384686671.
It is not a de Polignac number, because 17668648314093 - 212 = 17668648309997 is a prime.
It is a super-2 number, since 2×176686483140932 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (17668648314013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 53610753 + ... + 53939318.
It is an arithmetic number, because the mean of its divisors is an integer number (1682943526656).
Almost surely, 217668648314093 is an apocalyptic number.
It is an amenable number.
17668648314093 is a deficient number, since it is larger than the sum of its proper divisors (9258448112403).
17668648314093 is a wasteful number, since it uses less digits than its factorization.
17668648314093 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 107557904.
The product of its (nonzero) digits is 125411328, while the sum is 66.
The spelling of 17668648314093 in words is "seventeen trillion, six hundred sixty-eight billion, six hundred forty-eight million, three hundred fourteen thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •