Base | Representation |
---|---|
bin | 1100101001000… |
… | …00101101001101 |
3 | 21101112101201122 |
4 | 12110200231031 |
5 | 204121241031 |
6 | 14304450325 |
7 | 2425216634 |
oct | 624405515 |
9 | 241471648 |
10 | 106040141 |
11 | 54947589 |
12 | 2b6199a5 |
13 | 18c79b5c |
14 | 1012451b |
15 | 949947b |
hex | 6520b4d |
106040141 has 4 divisors (see below), whose sum is σ = 106340892. Its totient is φ = 105739392.
The previous prime is 106040093. The next prime is 106040147. The reversal of 106040141 is 141040601.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 13322500 + 92717641 = 3650^2 + 9629^2 .
It is a cyclic number.
It is not a de Polignac number, because 106040141 - 210 = 106039117 is a prime.
It is a super-2 number, since 2×1060401412 = 22489023006599762, 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 (106040147) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 149846 + ... + 150551.
It is an arithmetic number, because the mean of its divisors is an integer number (26585223).
Almost surely, 2106040141 is an apocalyptic number.
It is an amenable number.
106040141 is a deficient number, since it is larger than the sum of its proper divisors (300751).
106040141 is an equidigital number, since it uses as much as digits as its factorization.
106040141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 300750.
The product of its (nonzero) digits is 96, while the sum is 17.
The square root of 106040141 is about 10297.5793757562. The cubic root of 106040141 is about 473.3220812750.
Adding to 106040141 its reverse (141040601), we get a palindrome (247080742).
The spelling of 106040141 in words is "one hundred six million, forty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •