Base | Representation |
---|---|
bin | 1111000110100100010101… |
… | …0010010110100010010111 |
3 | 2011210110201021010220100020 |
4 | 3301221011102112202113 |
5 | 4134031034014131033 |
6 | 55152244131120223 |
7 | 3332464630105566 |
oct | 361510522264227 |
9 | 64713637126306 |
10 | 16605506005143 |
11 | 53223a0265140 |
12 | 1a42312443073 |
13 | 935b7aa7c913 |
14 | 4159d453dbdd |
15 | 1dbe323026b3 |
hex | f1a45496897 |
16605506005143 has 32 divisors (see below), whose sum is σ = 24202402156032. Its totient is φ = 10043564803200.
The previous prime is 16605506005097. The next prime is 16605506005169. The reversal of 16605506005143 is 34150060550661.
It is not a de Polignac number, because 16605506005143 - 28 = 16605506004887 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 16605506005095 and 16605506005104.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16605506005183) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 51565038 + ... + 51886068.
It is an arithmetic number, because the mean of its divisors is an integer number (756325067376).
Almost surely, 216605506005143 is an apocalyptic number.
16605506005143 is a deficient number, since it is larger than the sum of its proper divisors (7596896150889).
16605506005143 is a wasteful number, since it uses less digits than its factorization.
16605506005143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 324215.
The product of its (nonzero) digits is 324000, while the sum is 42.
The spelling of 16605506005143 in words is "sixteen trillion, six hundred five billion, five hundred six million, five thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •