Base | Representation |
---|---|
bin | 110001000011100000… |
… | …1001010011011001111 |
3 | 101001220122011020022012 |
4 | 1202013001022123033 |
5 | 3211221134202421 |
6 | 120221121011435 |
7 | 10416351000134 |
oct | 1420701123317 |
9 | 331818136265 |
10 | 105344444111 |
11 | 40749213065 |
12 | 184bb783b7b |
13 | 9c1ab2a6ca |
14 | 5154b8458b |
15 | 2b1852d95b |
hex | 188704a6cf |
105344444111 has 4 divisors (see below), whose sum is σ = 105350619192. Its totient is φ = 105338269032.
The previous prime is 105344444053. The next prime is 105344444123. The reversal of 105344444111 is 111444443501.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 105344444111 - 218 = 105344181967 is a prime.
It is a super-2 number, since 2×1053444441112 (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 (105344444141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3061880 + ... + 3096093.
It is an arithmetic number, because the mean of its divisors is an integer number (26337654798).
Almost surely, 2105344444111 is an apocalyptic number.
105344444111 is a deficient number, since it is larger than the sum of its proper divisors (6175081).
105344444111 is an equidigital number, since it uses as much as digits as its factorization.
105344444111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6175080.
The product of its (nonzero) digits is 15360, while the sum is 32.
Adding to 105344444111 its reverse (111444443501), we get a palindrome (216788887612).
The spelling of 105344444111 in words is "one hundred five billion, three hundred forty-four million, four hundred forty-four thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •