Base | Representation |
---|---|
bin | 1100100011101… |
… | …01110010001001 |
3 | 21100012211101000 |
4 | 12101311302021 |
5 | 203431340131 |
6 | 14241445213 |
7 | 2416242552 |
oct | 621656211 |
9 | 240184330 |
10 | 105340041 |
11 | 54509594 |
12 | 2b340809 |
13 | 18a932b1 |
14 | ddc1329 |
15 | 93abce6 |
hex | 6475c89 |
105340041 has 16 divisors (see below), whose sum is σ = 165240000. Its totient is φ = 66095424.
The previous prime is 105340021. The next prime is 105340063. The reversal of 105340041 is 140043501.
It is a happy number.
It is not a de Polignac number, because 105340041 - 218 = 105077897 is a prime.
It is a super-2 number, since 2×1053400412 = 22193048475763362, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 105339996 and 105340023.
It is not an unprimeable number, because it can be changed into a prime (105340021) 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 15 ways as a sum of consecutive naturals, for example, 114291 + ... + 115208.
It is an arithmetic number, because the mean of its divisors is an integer number (10327500).
Almost surely, 2105340041 is an apocalyptic number.
It is an amenable number.
105340041 is a deficient number, since it is larger than the sum of its proper divisors (59899959).
105340041 is a wasteful number, since it uses less digits than its factorization.
105340041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 229525 (or 229519 counting only the distinct ones).
The product of its (nonzero) digits is 240, while the sum is 18.
The square root of 105340041 is about 10263.5296560199. The cubic root of 105340041 is about 472.2781220797.
Adding to 105340041 its reverse (140043501), we get a palindrome (245383542).
The spelling of 105340041 in words is "one hundred five million, three hundred forty thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •