Base | Representation |
---|---|
bin | 110001001001110011… |
… | …0101100110111111010 |
3 | 101002110100111121222220 |
4 | 1202103212230313322 |
5 | 3212134214024010 |
6 | 120254103024510 |
7 | 10424523614334 |
oct | 1422346546772 |
9 | 332410447886 |
10 | 105555611130 |
11 | 40847432a62 |
12 | 1855a43b136 |
13 | 9c527c47c8 |
14 | 5174c32454 |
15 | 2b2bd41970 |
hex | 18939acdfa |
105555611130 has 32 divisors (see below), whose sum is σ = 253352026368. Its totient is φ = 28146100800.
The previous prime is 105555611129. The next prime is 105555611137. The reversal of 105555611130 is 31116555501.
It is a super-2 number, since 2×1055556111302 (a number of 23 digits) contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 105555611091 and 105555611100.
It is not an unprimeable number, because it can be changed into a prime (105555611137) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 312175 + ... + 555485.
It is an arithmetic number, because the mean of its divisors is an integer number (7917250824).
Almost surely, 2105555611130 is an apocalyptic number.
105555611130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
105555611130 is an abundant number, since it is smaller than the sum of its proper divisors (147796415238).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105555611130 is a wasteful number, since it uses less digits than its factorization.
105555611130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 257782.
The product of its (nonzero) digits is 11250, while the sum is 33.
The spelling of 105555611130 in words is "one hundred five billion, five hundred fifty-five million, six hundred eleven thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •