Base | Representation |
---|---|
bin | 1111011111010110111100… |
… | …1000110110100000000001 |
3 | 2020022012001020111111020001 |
4 | 3313311233020312200001 |
5 | 4213020311414420001 |
6 | 100120042142120001 |
7 | 3405323133463351 |
oct | 367655710664001 |
9 | 66265036444201 |
10 | 17031409920001 |
11 | 5476a8698a134 |
12 | 1ab0974880001 |
13 | 967093c8ba19 |
14 | 42c478b44b61 |
15 | 1e805ce20001 |
hex | f7d6f236801 |
17031409920001 has 4 divisors (see below), whose sum is σ = 18033257562372. Its totient is φ = 16029562277632.
The previous prime is 17031409919983. The next prime is 17031409920011. The reversal of 17031409920001 is 10002990413071.
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 12753462297601 + 4277947622400 = 3571199^2 + 2068320^2 .
It is not a de Polignac number, because 17031409920001 - 231 = 17029262436353 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (17031409920011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 500923821160 + ... + 500923821193.
It is an arithmetic number, because the mean of its divisors is an integer number (4508314390593).
Almost surely, 217031409920001 is an apocalyptic number.
It is an amenable number.
17031409920001 is a deficient number, since it is larger than the sum of its proper divisors (1001847642371).
17031409920001 is a wasteful number, since it uses less digits than its factorization.
17031409920001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1001847642370.
The product of its (nonzero) digits is 13608, while the sum is 37.
The spelling of 17031409920001 in words is "seventeen trillion, thirty-one billion, four hundred nine million, nine hundred twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •