Base | Representation |
---|---|
bin | 110001000110011010… |
… | …1011001101001100011 |
3 | 101002011102202210210110 |
4 | 1202030311121221203 |
5 | 3211421124232120 |
6 | 120234524302403 |
7 | 10421644262535 |
oct | 1421465315143 |
9 | 332142683713 |
10 | 105442024035 |
11 | 40799301327 |
12 | 185283a1a03 |
13 | 9c351047ca |
14 | 5163b05855 |
15 | 2b21da62e0 |
hex | 188cd59a63 |
105442024035 has 32 divisors (see below), whose sum is σ = 170937584640. Its totient is φ = 55493088768.
The previous prime is 105442024001. The next prime is 105442024069. The reversal of 105442024035 is 530420244501.
It is an interprime number because it is at equal distance from previous prime (105442024001) and next prime (105442024069).
It is not a de Polignac number, because 105442024035 - 221 = 105439926883 is a prime.
It is a super-2 number, since 2×1054420240352 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 105442023993 and 105442024011.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2195752 + ... + 2243258.
It is an arithmetic number, because the mean of its divisors is an integer number (5341799520).
Almost surely, 2105442024035 is an apocalyptic number.
105442024035 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
105442024035 is a deficient number, since it is larger than the sum of its proper divisors (65495560605).
105442024035 is a wasteful number, since it uses less digits than its factorization.
105442024035 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 49467.
The product of its (nonzero) digits is 19200, while the sum is 30.
Adding to 105442024035 its reverse (530420244501), we get a palindrome (635862268536).
The spelling of 105442024035 in words is "one hundred five billion, four hundred forty-two million, twenty-four thousand, thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •