Base | Representation |
---|---|
bin | 1100101100001… |
… | …10101101010101 |
3 | 21102022121211201 |
4 | 12112012231111 |
5 | 204223123231 |
6 | 14321432501 |
7 | 2431610002 |
oct | 626065525 |
9 | 242277751 |
10 | 106457941 |
11 | 55102477 |
12 | 2b79b731 |
13 | 19095085 |
14 | 101d28a9 |
15 | 952d161 |
hex | 6586b55 |
106457941 has 2 divisors, whose sum is σ = 106457942. Its totient is φ = 106457940.
The previous prime is 106457909. The next prime is 106457947. The reversal of 106457941 is 149754601.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 98922916 + 7535025 = 9946^2 + 2745^2 .
It is an emirp because it is prime and its reverse (149754601) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 106457941 - 25 = 106457909 is a prime.
It is a super-2 number, since 2×1064579412 = 22666586403918962, which contains 22 as substring.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 106457941.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (106457947) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53228970 + 53228971.
It is an arithmetic number, because the mean of its divisors is an integer number (53228971).
Almost surely, 2106457941 is an apocalyptic number.
It is an amenable number.
106457941 is a deficient number, since it is larger than the sum of its proper divisors (1).
106457941 is an equidigital number, since it uses as much as digits as its factorization.
106457941 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 30240, while the sum is 37.
The square root of 106457941 is about 10317.8457538383. The cubic root of 106457941 is about 473.9428990542.
The spelling of 106457941 in words is "one hundred six million, four hundred fifty-seven thousand, nine hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •