Base | Representation |
---|---|
bin | 10000001101000100… |
… | …001000000000000101 |
3 | 1122220120101112120001 |
4 | 100031010020000011 |
5 | 241113124214331 |
6 | 11554254041301 |
7 | 1154110343644 |
oct | 201504100005 |
9 | 48816345501 |
10 | 17399054341 |
11 | 7419349059 |
12 | 3456aa9231 |
13 | 1843893436 |
14 | bb0ab935b |
15 | 6bc750561 |
hex | 40d108005 |
17399054341 has 4 divisors (see below), whose sum is σ = 17399472300. Its totient is φ = 17398636384.
The previous prime is 17399054293. The next prime is 17399054369. The reversal of 17399054341 is 14345099371.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 8629481025 + 8769573316 = 92895^2 + 93646^2 .
It is a cyclic number.
It is not a de Polignac number, because 17399054341 - 225 = 17365499909 is a prime.
It is a super-2 number, since 2×173990543412 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 17399054291 and 17399054300.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (17399054441) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 138646 + ... + 232423.
It is an arithmetic number, because the mean of its divisors is an integer number (4349868075).
Almost surely, 217399054341 is an apocalyptic number.
It is an amenable number.
17399054341 is a deficient number, since it is larger than the sum of its proper divisors (417959).
17399054341 is an equidigital number, since it uses as much as digits as its factorization.
17399054341 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 417958.
The product of its (nonzero) digits is 408240, while the sum is 46.
The spelling of 17399054341 in words is "seventeen billion, three hundred ninety-nine million, fifty-four thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.060 sec. • engine limits •