Base | Representation |
---|---|
bin | 1111000110010100001010… |
… | …1001000101101101110100 |
3 | 2011210001111211220122221100 |
4 | 3301211002221011231310 |
5 | 4133443142131312422 |
6 | 55150245400050100 |
7 | 3332252246251053 |
oct | 361450251055564 |
9 | 64701454818840 |
10 | 16601166666612 |
11 | 5320573878950 |
12 | 1a41501163930 |
13 | 935638a68998 |
14 | 4157020d639a |
15 | 1dbc7b39c7ac |
hex | f1942a45b74 |
16601166666612 has 144 divisors (see below), whose sum is σ = 46240274650752. Its totient is φ = 4979999888640.
The previous prime is 16601166666569. The next prime is 16601166666629. The reversal of 16601166666612 is 21666666110661.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 114011278 + ... + 114156794.
It is an arithmetic number, because the mean of its divisors is an integer number (321113018408).
Almost surely, 216601166666612 is an apocalyptic number.
16601166666612 is a gapful number since it is divisible by the number (12) 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 16601166666612, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (23120137325376).
16601166666612 is an abundant number, since it is smaller than the sum of its proper divisors (29639107984140).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16601166666612 is a wasteful number, since it uses less digits than its factorization.
16601166666612 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 148438 (or 148433 counting only the distinct ones).
The product of its (nonzero) digits is 3359232, while the sum is 54.
The spelling of 16601166666612 in words is "sixteen trillion, six hundred one billion, one hundred sixty-six million, six hundred sixty-six thousand, six hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •