Base | Representation |
---|---|
bin | 1111000110100100010101… |
… | …0010010110100010011000 |
3 | 2011210110201021010220100021 |
4 | 3301221011102112202120 |
5 | 4134031034014131034 |
6 | 55152244131120224 |
7 | 3332464630105600 |
oct | 361510522264230 |
9 | 64713637126307 |
10 | 16605506005144 |
11 | 53223a0265141 |
12 | 1a42312443074 |
13 | 935b7aa7c914 |
14 | 4159d453dc00 |
15 | 1dbe323026b4 |
hex | f1a45496898 |
16605506005144 has 48 divisors (see below), whose sum is σ = 36221227948080. Its totient is φ = 7116137300160.
The previous prime is 16605506005097. The next prime is 16605506005169. The reversal of 16605506005144 is 44150060550661.
It is a self number, because there is not a number n which added to its sum of digits gives 16605506005144.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 4010574 + ... + 7021090.
It is an arithmetic number, because the mean of its divisors is an integer number (754608915585).
Almost surely, 216605506005144 is an apocalyptic number.
16605506005144 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
16605506005144 is an abundant number, since it is smaller than the sum of its proper divisors (19615721942936).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16605506005144 is a wasteful number, since it uses less digits than its factorization.
16605506005144 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3024608 (or 3024597 counting only the distinct ones).
The product of its (nonzero) digits is 432000, while the sum is 43.
The spelling of 16605506005144 in words is "sixteen trillion, six hundred five billion, five hundred six million, five thousand, one hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •