Base | Representation |
---|---|
bin | 1000001010011001100011… |
… | …00010101001001000111011 |
3 | 2100112221210111000012020112 |
4 | 10011030301202221020323 |
5 | 4323041033332314341 |
6 | 102101515232014535 |
7 | 3531544221221462 |
oct | 405146142511073 |
9 | 70487714005215 |
10 | 17949499494971 |
11 | 57a0381582390 |
12 | 201a89709144b |
13 | a028273aba35 |
14 | 460a907d39d9 |
15 | 211d935eaaeb |
hex | 1053318a923b |
17949499494971 has 8 divisors (see below), whose sum is σ = 20212926117888. Its totient is φ = 15791348529000.
The previous prime is 17949499494967. The next prime is 17949499495069.
17949499494971 is nontrivially palindromic in base 10.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 17949499494971 - 22 = 17949499494967 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (17949499494961) 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 7 ways as a sum of consecutive naturals, for example, 26318913875 + ... + 26318914556.
It is an arithmetic number, because the mean of its divisors is an integer number (2526615764736).
Almost surely, 217949499494971 is an apocalyptic number.
17949499494971 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
17949499494971 is a deficient number, since it is larger than the sum of its proper divisors (2263426622917).
17949499494971 is a wasteful number, since it uses less digits than its factorization.
17949499494971 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52637828473.
The product of its digits is 6666395904, while the sum is 86.
The spelling of 17949499494971 in words is "seventeen trillion, nine hundred forty-nine billion, four hundred ninety-nine million, four hundred ninety-four thousand, nine hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •