Base | Representation |
---|---|
bin | 10000000100100111… |
… | …001001010111000001 |
3 | 1122112200112121212002 |
4 | 100010213021113001 |
5 | 240320323140001 |
6 | 11532230313345 |
7 | 1150436056031 |
oct | 200447112701 |
9 | 48480477762 |
10 | 17257240001 |
11 | 7356297921 |
12 | 34174b8855 |
13 | 182039c321 |
14 | b99d218c1 |
15 | 6b008b46b |
hex | 4049c95c1 |
17257240001 has 4 divisors (see below), whose sum is σ = 17343960000. Its totient is φ = 17170520004.
The previous prime is 17257239983. The next prime is 17257240003. The reversal of 17257240001 is 10004275271.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 10004275271 = 83 ⋅120533437.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-17257240001 is a prime.
It is a super-2 number, since 2×172572400012 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (17257240003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 43359701 + ... + 43360098.
It is an arithmetic number, because the mean of its divisors is an integer number (4335990000).
Almost surely, 217257240001 is an apocalyptic number.
It is an amenable number.
17257240001 is a deficient number, since it is larger than the sum of its proper divisors (86719999).
17257240001 is an equidigital number, since it uses as much as digits as its factorization.
17257240001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 86719998.
The product of its (nonzero) digits is 3920, while the sum is 29.
The spelling of 17257240001 in words is "seventeen billion, two hundred fifty-seven million, two hundred forty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •