Base | Representation |
---|---|
bin | 1111001001110000010100… |
… | …1011110010001111011000 |
3 | 2011222201001112001222121120 |
4 | 3302130011023302033120 |
5 | 4140430210332213012 |
6 | 55233341541005240 |
7 | 3336443620633134 |
oct | 362340513621730 |
9 | 64881045058546 |
10 | 16660265116632 |
11 | 5343640365085 |
12 | 1a50a550b3820 |
13 | 93b0967a8b37 |
14 | 41850ad483c4 |
15 | 1dd5898b958c |
hex | f27052f23d8 |
16660265116632 has 32 divisors (see below), whose sum is σ = 44100701780400. Its totient is φ = 5226749840384.
The previous prime is 16660265116619. The next prime is 16660265116637. The reversal of 16660265116632 is 23661156206661.
16660265116632 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16660265116637) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 20416991157 + ... + 20416991972.
Almost surely, 216660265116632 is an apocalyptic number.
16660265116632 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
16660265116632 is an abundant number, since it is smaller than the sum of its proper divisors (27440436663768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16660265116632 is a wasteful number, since it uses less digits than its factorization.
16660265116632 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 40833983155 (or 40833983151 counting only the distinct ones).
The product of its (nonzero) digits is 2799360, while the sum is 51.
The spelling of 16660265116632 in words is "sixteen trillion, six hundred sixty billion, two hundred sixty-five million, one hundred sixteen thousand, six hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •