Base | Representation |
---|---|
bin | 11000001011001110000… |
… | …110001010110110011100 |
3 | 12212211010220110021212010 |
4 | 120023032012022312130 |
5 | 204204333131200220 |
6 | 3311110404111220 |
7 | 231011636232510 |
oct | 30131606126634 |
9 | 5784126407763 |
10 | 1661315100060 |
11 | 590618077700 |
12 | 229b83095510 |
13 | c0879c77235 |
14 | 5a59dab2140 |
15 | 2d33450b1e0 |
hex | 182ce18ad9c |
1661315100060 has 144 divisors (see below), whose sum is σ = 5843435770368. Its totient is φ = 345208321920.
The previous prime is 1661315100043. The next prime is 1661315100091. The reversal of 1661315100060 is 600015131661.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
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 47 ways as a sum of consecutive naturals, for example, 16294272 + ... + 16395911.
It is an arithmetic number, because the mean of its divisors is an integer number (40579415072).
Almost surely, 21661315100060 is an apocalyptic number.
1661315100060 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1661315100060 is an abundant number, since it is smaller than the sum of its proper divisors (4182120670308).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1661315100060 is a wasteful number, since it uses less digits than its factorization.
1661315100060 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32690224 (or 32690211 counting only the distinct ones).
The product of its (nonzero) digits is 3240, while the sum is 30.
The spelling of 1661315100060 in words is "one trillion, six hundred sixty-one billion, three hundred fifteen million, one hundred thousand, sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •