Base | Representation |
---|---|
bin | 1111011001110100001001… |
… | …0011101100111110110001 |
3 | 2012222002012200222112101201 |
4 | 3312131002103230332301 |
5 | 4204440233114244421 |
6 | 100004211324131201 |
7 | 3365412021033253 |
oct | 366350223547661 |
9 | 65862180875351 |
10 | 16936168509361 |
11 | 543a652664712 |
12 | 1a96414696b01 |
13 | 95b0c62b4c3a |
14 | 427a01aa3cd3 |
15 | 1e5836852b91 |
hex | f67424ecfb1 |
16936168509361 has 24 divisors (see below), whose sum is σ = 18647564198760. Its totient is φ = 15327476835840.
The previous prime is 16936168509347. The next prime is 16936168509437. The reversal of 16936168509361 is 16390586163961.
It can be written as a sum of positive squares in 4 ways, for example, as 2429096805136 + 14507071704225 = 1558556^2 + 3808815^2 .
It is not a de Polignac number, because 16936168509361 - 29 = 16936168508849 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 16936168509293 and 16936168509302.
It is not an unprimeable number, because it can be changed into a prime (16936168609361) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 736606 + ... + 5866423.
It is an arithmetic number, because the mean of its divisors is an integer number (776981841615).
Almost surely, 216936168509361 is an apocalyptic number.
It is an amenable number.
16936168509361 is a deficient number, since it is larger than the sum of its proper divisors (1711395689399).
16936168509361 is a wasteful number, since it uses less digits than its factorization.
16936168509361 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6603265 (or 6603234 counting only the distinct ones).
The product of its (nonzero) digits is 37791360, while the sum is 64.
The spelling of 16936168509361 in words is "sixteen trillion, nine hundred thirty-six billion, one hundred sixty-eight million, five hundred nine thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •