Base | Representation |
---|---|
bin | 110001000011011110… |
… | …1010001101010001001 |
3 | 101001220120020110120022 |
4 | 1202012331101222021 |
5 | 3211220404101121 |
6 | 120221043110225 |
7 | 10416336224342 |
oct | 1420675215211 |
9 | 331816213508 |
10 | 105343425161 |
11 | 40748687557 |
12 | 184bb372375 |
13 | 9c1a861990 |
14 | 515499b0c9 |
15 | 2b183cbaab |
hex | 1886f51a89 |
105343425161 has 8 divisors (see below), whose sum is σ = 113570224320. Its totient is φ = 97134262992.
The previous prime is 105343425157. The next prime is 105343425191. The reversal of 105343425161 is 161524343501.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 105343425161 - 22 = 105343425157 is a prime.
It is a super-2 number, since 2×1053434251612 (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 (105343425101) 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 7 ways as a sum of consecutive naturals, for example, 4396835 + ... + 4420728.
It is an arithmetic number, because the mean of its divisors is an integer number (14196278040).
Almost surely, 2105343425161 is an apocalyptic number.
It is an amenable number.
105343425161 is a deficient number, since it is larger than the sum of its proper divisors (8226799159).
105343425161 is an equidigital number, since it uses as much as digits as its factorization.
105343425161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8818495.
The product of its (nonzero) digits is 43200, while the sum is 35.
Adding to 105343425161 its reverse (161524343501), we get a palindrome (266867768662).
The spelling of 105343425161 in words is "one hundred five billion, three hundred forty-three million, four hundred twenty-five thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •