Base | Representation |
---|---|
bin | 1110100110100010001001… |
… | …1110001110100010100000 |
3 | 2002211212012010112010120010 |
4 | 3221220202132032202200 |
5 | 4101021440010223124 |
6 | 54051350321044520 |
7 | 3244642661110224 |
oct | 351504236164240 |
9 | 62755163463503 |
10 | 16055166101664 |
11 | 512aa59786128 |
12 | 1973722786740 |
13 | 8c5cc3632711 |
14 | 3d71077ca784 |
15 | 1cc972087529 |
hex | e9a2278e8a0 |
16055166101664 has 48 divisors (see below), whose sum is σ = 44623917551808. Its totient is φ = 5036914854912.
The previous prime is 16055166101599. The next prime is 16055166101669. The reversal of 16055166101664 is 46610166155061.
It is a tau number, because it is divible by the number of its divisors (48).
It is a Harshad number since it is a multiple of its sum of digits (48).
It is not an unprimeable number, because it can be changed into a prime (16055166101669) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 4918860532 + ... + 4918863795.
It is an arithmetic number, because the mean of its divisors is an integer number (929664948996).
Almost surely, 216055166101664 is an apocalyptic number.
It is an amenable number.
16055166101664 is an abundant number, since it is smaller than the sum of its proper divisors (28568751450144).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16055166101664 is a wasteful number, since it uses less digits than its factorization.
16055166101664 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9837724357 (or 9837724349 counting only the distinct ones).
The product of its (nonzero) digits is 777600, while the sum is 48.
The spelling of 16055166101664 in words is "sixteen trillion, fifty-five billion, one hundred sixty-six million, one hundred one thousand, six hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •