Base | Representation |
---|---|
bin | 1100100100111… |
… | …11110110010101 |
3 | 21100112120201111 |
4 | 12102133312111 |
5 | 204002343331 |
6 | 14245255021 |
7 | 2420561104 |
oct | 622376625 |
9 | 240476644 |
10 | 105512341 |
11 | 54616a90 |
12 | 2b404471 |
13 | 18b2384c |
14 | 1002803b |
15 | 93e2db1 |
hex | 649fd95 |
105512341 has 8 divisors (see below), whose sum is σ = 115449984. Its totient is φ = 95632320.
The previous prime is 105512299. The next prime is 105512357. The reversal of 105512341 is 143215501.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 105512341 - 27 = 105512213 is a prime.
It is a super-2 number, since 2×1055123412 = 22265708206600562, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105512441) 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, 10525 + ... + 17938.
It is an arithmetic number, because the mean of its divisors is an integer number (14431248).
Almost surely, 2105512341 is an apocalyptic number.
105512341 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
105512341 is a deficient number, since it is larger than the sum of its proper divisors (9937643).
105512341 is a wasteful number, since it uses less digits than its factorization.
105512341 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 28811.
The product of its (nonzero) digits is 600, while the sum is 22.
The square root of 105512341 is about 10271.9200250002. The cubic root of 105512341 is about 472.5354765595.
Adding to 105512341 its reverse (143215501), we get a palindrome (248727842).
The spelling of 105512341 in words is "one hundred five million, five hundred twelve thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •