Base | Representation |
---|---|
bin | 11110101111101011… |
… | …11111000000101111 |
3 | 1120121100020120000010 |
4 | 33113311333000233 |
5 | 232301033430210 |
6 | 11325520104303 |
7 | 1123016001015 |
oct | 172765770057 |
9 | 46540216003 |
10 | 16506155055 |
11 | 7000326665 |
12 | 3247a65093 |
13 | 17308b4a70 |
14 | b2828a8b5 |
15 | 669177920 |
hex | 3d7d7f02f |
16506155055 has 32 divisors (see below), whose sum is σ = 28449469440. Its totient is φ = 8123794560.
The previous prime is 16506155051. The next prime is 16506155077. The reversal of 16506155055 is 55055160561.
It is not a de Polignac number, because 16506155055 - 22 = 16506155051 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16506155051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 822936 + ... + 842754.
It is an arithmetic number, because the mean of its divisors is an integer number (889045920).
Almost surely, 216506155055 is an apocalyptic number.
16506155055 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
16506155055 is a deficient number, since it is larger than the sum of its proper divisors (11943314385).
16506155055 is a wasteful number, since it uses less digits than its factorization.
16506155055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24111.
The product of its (nonzero) digits is 112500, while the sum is 39.
It can be divided in two parts, 165061 and 55055, that added together give a triangular number (220116 = T663).
The spelling of 16506155055 in words is "sixteen billion, five hundred six million, one hundred fifty-five thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •