Base | Representation |
---|---|
bin | 1111001000100010110010… |
… | …0100101111110010111101 |
3 | 2011220201022221220011201002 |
4 | 3302020230210233302331 |
5 | 4140110043442311130 |
6 | 55220020333100045 |
7 | 3335106053001335 |
oct | 362105444576275 |
9 | 64821287804632 |
10 | 16639451135165 |
11 | 533582a415801 |
12 | 1a48a06627625 |
13 | 93912a594481 |
14 | 4174d48d80c5 |
15 | 1dcc6c463b45 |
hex | f222c92fcbd |
16639451135165 has 24 divisors (see below), whose sum is σ = 21784251854472. Its totient is φ = 12189919011840.
The previous prime is 16639451135147. The next prime is 16639451135173. The reversal of 16639451135165 is 56153115493661.
It is a happy number.
It can be written as a sum of positive squares in 12 ways, for example, as 2490674206969 + 14148776928196 = 1578187^2 + 3761486^2 .
It is not a de Polignac number, because 16639451135165 - 26 = 16639451135101 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 16639451135165.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 155557226 + ... + 155664155.
It is an arithmetic number, because the mean of its divisors is an integer number (907677160603).
Almost surely, 216639451135165 is an apocalyptic number.
It is an amenable number.
16639451135165 is a deficient number, since it is larger than the sum of its proper divisors (5144800719307).
16639451135165 is a wasteful number, since it uses less digits than its factorization.
16639451135165 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 311221457 (or 311221440 counting only the distinct ones).
The product of its digits is 8748000, while the sum is 56.
The spelling of 16639451135165 in words is "sixteen trillion, six hundred thirty-nine billion, four hundred fifty-one million, one hundred thirty-five thousand, one hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •