Base | Representation |
---|---|
bin | 1111001010011110010110… |
… | …1101111101110101000001 |
3 | 2012000212221200221012000101 |
4 | 3302213211231331311001 |
5 | 4141131012224423334 |
6 | 55243144042122401 |
7 | 3340362055423012 |
oct | 362474555756501 |
9 | 65025850835011 |
10 | 16672622107969 |
11 | 5348901586613 |
12 | 1a533234b0401 |
13 | 93c2b58a3b29 |
14 | 418d60133009 |
15 | 1dda5e655214 |
hex | f29e5b7dd41 |
16672622107969 has 2 divisors, whose sum is σ = 16672622107970. Its totient is φ = 16672622107968.
The previous prime is 16672622107943. The next prime is 16672622108017. The reversal of 16672622107969 is 96970122627661.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 13275733513744 + 3396888594225 = 3643588^2 + 1843065^2 .
It is a cyclic number.
It is not a de Polignac number, because 16672622107969 - 235 = 16638262369601 is a prime.
It is a super-2 number, since 2×166726221079692 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 16672622107969.
It is not a weakly prime, because it can be changed into another prime (16672622107769) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 8336311053984 + 8336311053985.
It is an arithmetic number, because the mean of its divisors is an integer number (8336311053985).
Almost surely, 216672622107969 is an apocalyptic number.
It is an amenable number.
16672622107969 is a deficient number, since it is larger than the sum of its proper divisors (1).
16672622107969 is an equidigital number, since it uses as much as digits as its factorization.
16672622107969 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 41150592, while the sum is 64.
The spelling of 16672622107969 in words is "sixteen trillion, six hundred seventy-two billion, six hundred twenty-two million, one hundred seven thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •