Base | Representation |
---|---|
bin | 110001001000010010… |
… | …1101011000110111111 |
3 | 101002022211021211110002 |
4 | 1202100211223012333 |
5 | 3212033240310421 |
6 | 120245054304515 |
7 | 10423340534444 |
oct | 1422045530677 |
9 | 332284254402 |
10 | 105505010111 |
11 | 40820911736 |
12 | 185454b813b |
13 | 9c45188987 |
14 | 516c21d9cb |
15 | 2b27698b0b |
hex | 189096b1bf |
105505010111 has 8 divisors (see below), whose sum is σ = 111284102400. Its totient is φ = 99748537560.
The previous prime is 105505010099. The next prime is 105505010129. The reversal of 105505010111 is 111010505501.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 105505010111 - 218 = 105504747967 is a prime.
It is a super-2 number, since 2×1055050101112 (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 (105505010911) 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 7 ways as a sum of consecutive naturals, for example, 5645351 + ... + 5664008.
It is an arithmetic number, because the mean of its divisors is an integer number (13910512800).
Almost surely, 2105505010111 is an apocalyptic number.
105505010111 is a deficient number, since it is larger than the sum of its proper divisors (5779092289).
105505010111 is a wasteful number, since it uses less digits than its factorization.
105505010111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11309869.
The product of its (nonzero) digits is 125, while the sum is 20.
Adding to 105505010111 its reverse (111010505501), we get a palindrome (216515515612).
The spelling of 105505010111 in words is "one hundred five billion, five hundred five million, ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •