Base | Representation |
---|---|
bin | 1110100110110100111011… |
… | …0110001101110100111000 |
3 | 2002212100012100010212220222 |
4 | 3221231032312031310320 |
5 | 4101112300110230000 |
6 | 54053542342035212 |
7 | 3245211602545055 |
oct | 351551666156470 |
9 | 62770170125828 |
10 | 16060205555000 |
11 | 513210538aaa2 |
12 | 19746aa418b08 |
13 | 8c66176c6079 |
14 | 3d7464bdc02c |
15 | 1ccb696d3a85 |
hex | e9b4ed8dd38 |
16060205555000 has 80 divisors (see below), whose sum is σ = 37644505652160. Its totient is φ = 6421445600000.
The previous prime is 16060205554909. The next prime is 16060205555029. The reversal of 16060205555000 is 55550206061.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 11547065 + ... + 12862935.
It is an arithmetic number, because the mean of its divisors is an integer number (470556320652).
Almost surely, 216060205555000 is an apocalyptic number.
16060205555000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 16060205555000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (18822252826080).
16060205555000 is an abundant number, since it is smaller than the sum of its proper divisors (21584300097160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16060205555000 is a wasteful number, since it uses less digits than its factorization.
16060205555000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1318338 (or 1318319 counting only the distinct ones).
The product of its (nonzero) digits is 45000, while the sum is 35.
The spelling of 16060205555000 in words is "sixteen trillion, sixty billion, two hundred five million, five hundred fifty-five thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •