Base | Representation |
---|---|
bin | 110001001001111100… |
… | …0010010110111110100 |
3 | 101002110200011221121001 |
4 | 1202103320102313310 |
5 | 3212141404120340 |
6 | 120254345533044 |
7 | 10424611043554 |
oct | 1422370226764 |
9 | 332420157531 |
10 | 105560223220 |
11 | 40849aa3101 |
12 | 1855baa4184 |
13 | 9c5374ab5a |
14 | 51756b3164 |
15 | 2b2c45329a |
hex | 1893e12df4 |
105560223220 has 48 divisors (see below), whose sum is σ = 223728261120. Its totient is φ = 41834185344.
The previous prime is 105560223179. The next prime is 105560223341. The reversal of 105560223220 is 22322065501.
It is a super-2 number, since 2×1055602232202 (a number of 23 digits) contains 22 as substring.
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 15 ways as a sum of consecutive naturals, for example, 1848942 + ... + 1905178.
It is an arithmetic number, because the mean of its divisors is an integer number (4661005440).
Almost surely, 2105560223220 is an apocalyptic number.
105560223220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
105560223220 is an abundant number, since it is smaller than the sum of its proper divisors (118168037900).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105560223220 is a wasteful number, since it uses less digits than its factorization.
105560223220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57112 (or 57110 counting only the distinct ones).
The product of its (nonzero) digits is 7200, while the sum is 28.
Adding to 105560223220 its reverse (22322065501), we get a palindrome (127882288721).
The spelling of 105560223220 in words is "one hundred five billion, five hundred sixty million, two hundred twenty-three thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •