Base | Representation |
---|---|
bin | 110001001001101001… |
… | …1001110011001101101 |
3 | 101002102222220020111111 |
4 | 1202103103032121231 |
5 | 3212131412134311 |
6 | 120253401352021 |
7 | 10424432331343 |
oct | 1422323163155 |
9 | 332388806444 |
10 | 105550505581 |
11 | 408445660a4 |
12 | 18558798611 |
13 | 9c51727981 |
14 | 51742a3993 |
15 | 2b2b683d21 |
hex | 18934ce66d |
105550505581 has 4 divisors (see below), whose sum is σ = 105581489472. Its totient is φ = 105519521692.
The previous prime is 105550505549. The next prime is 105550505587. The reversal of 105550505581 is 185505055501.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 105550505581 - 25 = 105550505549 is a prime.
It is a super-2 number, since 2×1055505055812 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105550505587) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 15486835 + ... + 15493648.
It is an arithmetic number, because the mean of its divisors is an integer number (26395372368).
Almost surely, 2105550505581 is an apocalyptic number.
It is an amenable number.
105550505581 is a deficient number, since it is larger than the sum of its proper divisors (30983891).
105550505581 is an equidigital number, since it uses as much as digits as its factorization.
105550505581 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30983890.
The product of its (nonzero) digits is 125000, while the sum is 40.
The spelling of 105550505581 in words is "one hundred five billion, five hundred fifty million, five hundred five thousand, five hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •