Base | Representation |
---|---|
bin | 1100100100011… |
… | …11101100010001 |
3 | 21100102012221101 |
4 | 12102033230101 |
5 | 203443234121 |
6 | 14244024401 |
7 | 2420164132 |
oct | 622175421 |
9 | 240365841 |
10 | 105446161 |
11 | 54581297 |
12 | 2b392101 |
13 | 18acc6a2 |
14 | 1000bc89 |
15 | 93cd491 |
hex | 648fb11 |
105446161 has 2 divisors, whose sum is σ = 105446162. Its totient is φ = 105446160.
The previous prime is 105446153. The next prime is 105446177. The reversal of 105446161 is 161644501.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 69205761 + 36240400 = 8319^2 + 6020^2 .
It is an emirp because it is prime and its reverse (161644501) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 105446161 - 23 = 105446153 is a prime.
It is a super-3 number, since 3×1054461613 (a number of 25 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not a weakly prime, because it can be changed into another prime (105446101) 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 as a sum of consecutive naturals, namely, 52723080 + 52723081.
It is an arithmetic number, because the mean of its divisors is an integer number (52723081).
Almost surely, 2105446161 is an apocalyptic number.
It is an amenable number.
105446161 is a deficient number, since it is larger than the sum of its proper divisors (1).
105446161 is an equidigital number, since it uses as much as digits as its factorization.
105446161 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2880, while the sum is 28.
The square root of 105446161 is about 10268.6981161197. The cubic root of 105446161 is about 472.4366605092.
The spelling of 105446161 in words is "one hundred five million, four hundred forty-six thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •