Base | Representation |
---|---|
bin | 11000001110100110000110… |
… | …100011100001011111111000 |
3 | 111222021122220220012020121110 |
4 | 120032212012203201133320 |
5 | 102431303343340340111 |
6 | 1014343110322240320 |
7 | 31305265343102646 |
oct | 3016460643413770 |
9 | 458248826166543 |
10 | 106556101105656 |
11 | 30a52209187054 |
12 | bb4b3527b60a0 |
13 | 475c27439c0c7 |
14 | 1c454b2962196 |
15 | c4bb7e68a5a6 |
hex | 60e9868e17f8 |
106556101105656 has 32 divisors (see below), whose sum is σ = 266390510786640. Its totient is φ = 35518665965568.
The previous prime is 106556101105651. The next prime is 106556101105667. The reversal of 106556101105656 is 656501101655601.
It is a super-2 number, since 2×1065561011056562 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106556101105651) 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 7 ways as a sum of consecutive naturals, for example, 40035310 + ... + 42613826.
Almost surely, 2106556101105656 is an apocalyptic number.
It is an amenable number.
106556101105656 is an abundant number, since it is smaller than the sum of its proper divisors (159834409680984).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106556101105656 is a wasteful number, since it uses less digits than its factorization.
106556101105656 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4300383 (or 4300379 counting only the distinct ones).
The product of its (nonzero) digits is 810000, while the sum is 48.
Subtracting 106556101105656 from its reverse (656501101655601), we obtain a palindrome (549945000549945).
The spelling of 106556101105656 in words is "one hundred six trillion, five hundred fifty-six billion, one hundred one million, one hundred five thousand, six hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •