Base | Representation |
---|---|
bin | 1111011100011000100110… |
… | …0000001001010000100001 |
3 | 2020010022011011221000111101 |
4 | 3313012021200021100201 |
5 | 4211201140013014314 |
6 | 100040351541514401 |
7 | 3401533655605342 |
oct | 367061140112041 |
9 | 66108134830441 |
10 | 16980312626209 |
11 | 5457345890009 |
12 | 1aa2a94412a01 |
13 | 96230caa803a |
14 | 429bcc7bc0c9 |
15 | 1e6a6c07b174 |
hex | f7189809421 |
16980312626209 has 2 divisors, whose sum is σ = 16980312626210. Its totient is φ = 16980312626208.
The previous prime is 16980312626119. The next prime is 16980312626261. The reversal of 16980312626209 is 90262621308961.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 14398837376400 + 2581475249809 = 3794580^2 + 1606697^2 .
It is a cyclic number.
It is not a de Polignac number, because 16980312626209 - 215 = 16980312593441 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 16980312626209.
It is not a weakly prime, because it can be changed into another prime (16980312626309) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 8490156313104 + 8490156313105.
It is an arithmetic number, because the mean of its divisors is an integer number (8490156313105).
Almost surely, 216980312626209 is an apocalyptic number.
It is an amenable number.
16980312626209 is a deficient number, since it is larger than the sum of its proper divisors (1).
16980312626209 is an equidigital number, since it uses as much as digits as its factorization.
16980312626209 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3359232, while the sum is 55.
The spelling of 16980312626209 in words is "sixteen trillion, nine hundred eighty billion, three hundred twelve million, six hundred twenty-six thousand, two hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •