Base | Representation |
---|---|
bin | 110001000001111011… |
… | …1010010100100101001 |
3 | 101001202221120122002122 |
4 | 1202003313102210221 |
5 | 3211114112240033 |
6 | 120211550441025 |
7 | 10415136122216 |
oct | 1420367224451 |
9 | 331687518078 |
10 | 105291524393 |
11 | 40721358760 |
12 | 184a5b03175 |
13 | 9c0cb8c373 |
14 | 514bb2ab0d |
15 | 2b13a78a98 |
hex | 1883dd2929 |
105291524393 has 4 divisors (see below), whose sum is σ = 114863481168. Its totient is φ = 95719567620.
The previous prime is 105291524381. The next prime is 105291524413. The reversal of 105291524393 is 393425192501.
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 105291524393 - 234 = 88111655209 is a prime.
It is a super-2 number, since 2×1052915243932 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (105291529393) 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, 4785978371 + ... + 4785978392.
It is an arithmetic number, because the mean of its divisors is an integer number (28715870292).
Almost surely, 2105291524393 is an apocalyptic number.
It is an amenable number.
105291524393 is a deficient number, since it is larger than the sum of its proper divisors (9571956775).
105291524393 is an equidigital number, since it uses as much as digits as its factorization.
105291524393 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9571956774.
The product of its (nonzero) digits is 291600, while the sum is 44.
The spelling of 105291524393 in words is "one hundred five billion, two hundred ninety-one million, five hundred twenty-four thousand, three hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •