Base | Representation |
---|---|
bin | 110001000101100101… |
… | …1110011111001110111 |
3 | 101002002111200112100111 |
4 | 1202023023303321313 |
5 | 3211342033004221 |
6 | 120232055123451 |
7 | 10421160066613 |
oct | 1421313637167 |
9 | 332074615314 |
10 | 105414344311 |
11 | 40784716121 |
12 | 1851b073587 |
13 | 9c2c462983 |
14 | 516017c343 |
15 | 2b1e739be1 |
hex | 188b2f3e77 |
105414344311 has 4 divisors (see below), whose sum is σ = 111615188112. Its totient is φ = 99213500512.
The previous prime is 105414344237. The next prime is 105414344327. The reversal of 105414344311 is 113443414501.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 113443414501 = 967 ⋅117314803.
It is a cyclic number.
It is not a de Polignac number, because 105414344311 - 213 = 105414336119 is a prime.
It is a super-2 number, since 2×1054143443112 (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 (105414344381) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3100421875 + ... + 3100421908.
It is an arithmetic number, because the mean of its divisors is an integer number (27903797028).
Almost surely, 2105414344311 is an apocalyptic number.
105414344311 is a deficient number, since it is larger than the sum of its proper divisors (6200843801).
105414344311 is an equidigital number, since it uses as much as digits as its factorization.
105414344311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6200843800.
The product of its (nonzero) digits is 11520, while the sum is 31.
Adding to 105414344311 its reverse (113443414501), we get a palindrome (218857758812).
The spelling of 105414344311 in words is "one hundred five billion, four hundred fourteen million, three hundred forty-four thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •