Base | Representation |
---|---|
bin | 1100100001111… |
… | …00011010001011 |
3 | 21022202220000002 |
4 | 12100330122023 |
5 | 203401330120 |
6 | 14232433215 |
7 | 2414243450 |
oct | 620743213 |
9 | 238686002 |
10 | 105105035 |
11 | 54368a72 |
12 | 2b24880b |
13 | 18a10339 |
14 | dd5d827 |
15 | 9362375 |
hex | 643c68b |
105105035 has 32 divisors (see below), whose sum is σ = 150945792. Its totient is φ = 68739840.
The previous prime is 105105031. The next prime is 105105043. The reversal of 105105035 is 530501501.
It is a happy number.
It is not a de Polignac number, because 105105035 - 22 = 105105031 is a prime.
It is a super-4 number, since 4×1051050354 (a number of 33 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 105104998 and 105105016.
It is not an unprimeable number, because it can be changed into a prime (105105031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 78542 + ... + 79868.
It is an arithmetic number, because the mean of its divisors is an integer number (4717056).
Almost surely, 2105105035 is an apocalyptic number.
105105035 is a deficient number, since it is larger than the sum of its proper divisors (45840757).
105105035 is a wasteful number, since it uses less digits than its factorization.
105105035 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1443.
The product of its (nonzero) digits is 375, while the sum is 20.
The square root of 105105035 is about 10252.0746680855. The cubic root of 105105035 is about 471.9266544918.
Adding to 105105035 its reverse (530501501), we get a palindrome (635606536).
The spelling of 105105035 in words is "one hundred five million, one hundred five thousand, thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.028 sec. • engine limits •