Base | Representation |
---|---|
bin | 11101111001111101… |
… | …11010001101100100 |
3 | 1112102221021102000100 |
4 | 32330332322031210 |
5 | 230340202303420 |
6 | 11213101144100 |
7 | 1105604403435 |
oct | 167476721544 |
9 | 45387242010 |
10 | 16055509860 |
11 | 6899a0a215 |
12 | 3140b5b030 |
13 | 168b4204c0 |
14 | ac44a148c |
15 | 63e80d190 |
hex | 3bcfba364 |
16055509860 has 72 divisors (see below), whose sum is σ = 52448006520. Its totient is φ = 3952124928.
The previous prime is 16055509817. The next prime is 16055509861. The reversal of 16055509860 is 6890555061.
It is a happy number.
16055509860 is a `hidden beast` number, since 1 + 6 + 0 + 5 + 550 + 98 + 6 + 0 = 666.
It can be written as a sum of positive squares in 4 ways, for example, as 3178253376 + 12877256484 = 56376^2 + 113478^2 .
It is a Harshad number since it is a multiple of its sum of digits (45).
It is not an unprimeable number, because it can be changed into a prime (16055509861) 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, 3428325 + ... + 3433004.
It is an arithmetic number, because the mean of its divisors is an integer number (728444535).
Almost surely, 216055509860 is an apocalyptic number.
16055509860 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
16055509860 is an abundant number, since it is smaller than the sum of its proper divisors (36392496660).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16055509860 is a wasteful number, since it uses less digits than its factorization.
16055509860 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6861357 (or 6861352 counting only the distinct ones).
The product of its (nonzero) digits is 324000, while the sum is 45.
The spelling of 16055509860 in words is "sixteen billion, fifty-five million, five hundred nine thousand, eight hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •