Base | Representation |
---|---|
bin | 110000111111101010… |
… | …0101011111100010001 |
3 | 101001120122020021210110 |
4 | 1201333110223330101 |
5 | 3210440112010101 |
6 | 120200225551533 |
7 | 10413222446136 |
oct | 1417724537421 |
9 | 331518207713 |
10 | 105215344401 |
11 | 40692356592 |
12 | 184844a55a9 |
13 | 9bca16894b |
14 | 514197a58d |
15 | 2b0c02bcd6 |
hex | 187f52bf11 |
105215344401 has 8 divisors (see below), whose sum is σ = 141574164160. Its totient is φ = 69500043792.
The previous prime is 105215344391. The next prime is 105215344411. The reversal of 105215344401 is 104443512501.
It is an interprime number because it is at equal distance from previous prime (105215344391) and next prime (105215344411).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 105215344401 - 213 = 105215336209 is a prime.
It is a super-2 number, since 2×1052153444012 (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 (105215344411) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 160879405 + ... + 160880058.
It is an arithmetic number, because the mean of its divisors is an integer number (17696770520).
Almost surely, 2105215344401 is an apocalyptic number.
It is an amenable number.
105215344401 is a deficient number, since it is larger than the sum of its proper divisors (36358819759).
105215344401 is a wasteful number, since it uses less digits than its factorization.
105215344401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 321759575.
The product of its (nonzero) digits is 9600, while the sum is 30.
Adding to 105215344401 its reverse (104443512501), we get a palindrome (209658856902).
The spelling of 105215344401 in words is "one hundred five billion, two hundred fifteen million, three hundred forty-four thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •