Base | Representation |
---|---|
bin | 11000000110010111100… |
… | …101100001011110111100 |
3 | 12212022200211212112011120 |
4 | 120012113211201132330 |
5 | 204113201013330202 |
6 | 3304445430350540 |
7 | 230435561243433 |
oct | 30062745413674 |
9 | 5768624775146 |
10 | 1656105605052 |
11 | 589394491a28 |
12 | 228b6a4bb450 |
13 | c02298b8602 |
14 | 5a227c7a11a |
15 | 2d12bec20bc |
hex | 181979617bc |
1656105605052 has 24 divisors (see below), whose sum is σ = 4032257126016. Its totient is φ = 528033671088.
The previous prime is 1656105605009. The next prime is 1656105605059. The reversal of 1656105605052 is 2505065016561.
It is a junction number, because it is equal to n+sod(n) for n = 1656105604995 and 1656105605013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1656105605059) 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, 3000191038 + ... + 3000191589.
It is an arithmetic number, because the mean of its divisors is an integer number (168010713584).
Almost surely, 21656105605052 is an apocalyptic number.
1656105605052 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1656105605052 is an abundant number, since it is smaller than the sum of its proper divisors (2376151520964).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1656105605052 is a wasteful number, since it uses less digits than its factorization.
1656105605052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6000382657 (or 6000382655 counting only the distinct ones).
The product of its (nonzero) digits is 270000, while the sum is 42.
The spelling of 1656105605052 in words is "one trillion, six hundred fifty-six billion, one hundred five million, six hundred five thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •