Base | Representation |
---|---|
bin | 110001000111101011… |
… | …1111010100010111111 |
3 | 101002021101221012212010 |
4 | 1202033113322202333 |
5 | 3212013031013421 |
6 | 120243045342303 |
7 | 10423002346044 |
oct | 1421727724277 |
9 | 332241835763 |
10 | 105484626111 |
11 | 40810359957 |
12 | 1853a707993 |
13 | 9c40b9c837 |
14 | 51696351cb |
15 | 2b259be076 |
hex | 188f5fa8bf |
105484626111 has 4 divisors (see below), whose sum is σ = 140646168152. Its totient is φ = 70323084072.
The previous prime is 105484626097. The next prime is 105484626127. The reversal of 105484626111 is 111626484501.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 105484626111 - 222 = 105480431807 is a prime.
It is a super-2 number, since 2×1054846261112 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 105484626111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105484626161) 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 3 ways as a sum of consecutive naturals, for example, 17580771016 + ... + 17580771021.
It is an arithmetic number, because the mean of its divisors is an integer number (35161542038).
Almost surely, 2105484626111 is an apocalyptic number.
105484626111 is a deficient number, since it is larger than the sum of its proper divisors (35161542041).
105484626111 is an equidigital number, since it uses as much as digits as its factorization.
105484626111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35161542040.
The product of its (nonzero) digits is 46080, while the sum is 39.
The spelling of 105484626111 in words is "one hundred five billion, four hundred eighty-four million, six hundred twenty-six thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •