Base | Representation |
---|---|
bin | 110001000000001111… |
… | …0110111110100111101 |
3 | 101001121222211022112022 |
4 | 1202000132313310331 |
5 | 3211010101313431 |
6 | 120202202445525 |
7 | 10413546654002 |
oct | 1420036676475 |
9 | 331558738468 |
10 | 105234791741 |
11 | 406a2329672 |
12 | 1848ab038a5 |
13 | 9c011b7651 |
14 | 514439d8a9 |
15 | 2b0dabe07b |
hex | 18807b7d3d |
105234791741 has 4 divisors (see below), whose sum is σ = 105236729184. Its totient is φ = 105232854300.
The previous prime is 105234791737. The next prime is 105234791743. The reversal of 105234791741 is 147197432501.
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 105234791741 - 22 = 105234791737 is a prime.
It is a super-2 number, since 2×1052347917412 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 105234791692 and 105234791701.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105234791743) 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, 884825 + ... + 996686.
It is an arithmetic number, because the mean of its divisors is an integer number (26309182296).
Almost surely, 2105234791741 is an apocalyptic number.
It is an amenable number.
105234791741 is a deficient number, since it is larger than the sum of its proper divisors (1937443).
105234791741 is an equidigital number, since it uses as much as digits as its factorization.
105234791741 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1937442.
The product of its (nonzero) digits is 211680, while the sum is 44.
The spelling of 105234791741 in words is "one hundred five billion, two hundred thirty-four million, seven hundred ninety-one thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •