Base | Representation |
---|---|
bin | 11111100110000010101… |
… | …111101010001010111100 |
3 | 21200120010022120010000212 |
4 | 133212002233222022330 |
5 | 241033004404003220 |
6 | 4341225150411552 |
7 | 312601112431436 |
oct | 37460257521274 |
9 | 7616108503025 |
10 | 2171152016060 |
11 | 767864790745 |
12 | 2b094a500bb8 |
13 | 12997b082061 |
14 | 77127525656 |
15 | 3b723a360c5 |
hex | 1f982bea2bc |
2171152016060 has 48 divisors (see below), whose sum is σ = 4866985751040. Its totient is φ = 811164271680.
The previous prime is 2171152016053. The next prime is 2171152016063. The reversal of 2171152016060 is 606102511712.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2171152016063) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 40209344 + ... + 40263303.
It is an arithmetic number, because the mean of its divisors is an integer number (101395536480).
Almost surely, 22171152016060 is an apocalyptic number.
2171152016060 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2171152016060 is an abundant number, since it is smaller than the sum of its proper divisors (2695833734980).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2171152016060 is a wasteful number, since it uses less digits than its factorization.
2171152016060 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 80472746 (or 80472744 counting only the distinct ones).
The product of its (nonzero) digits is 5040, while the sum is 32.
Adding to 2171152016060 its reverse (606102511712), we get a palindrome (2777254527772).
The spelling of 2171152016060 in words is "two trillion, one hundred seventy-one billion, one hundred fifty-two million, sixteen thousand, sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •