Base | Representation |
---|---|
bin | 1100101000101… |
… | …00100110001101 |
3 | 21101102212200121 |
4 | 12110110212031 |
5 | 204113144131 |
6 | 14303424541 |
7 | 2424622216 |
oct | 624244615 |
9 | 241385617 |
10 | 105990541 |
11 | 54913298 |
12 | 2b5b5151 |
13 | 18c603c7 |
14 | 1011040d |
15 | 9489911 |
hex | 651498d |
105990541 has 2 divisors, whose sum is σ = 105990542. Its totient is φ = 105990540.
The previous prime is 105990527. The next prime is 105990559. The reversal of 105990541 is 145099501.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 104980516 + 1010025 = 10246^2 + 1005^2 .
It is a cyclic number.
It is not a de Polignac number, because 105990541 - 27 = 105990413 is a prime.
It is a super-2 number, since 2×1059905412 = 22467989562945362, which contains 22 as substring.
It is equal to p6086248 and since 105990541 and 6086248 have the same sum of digits, it is a Honaker prime.
It is a junction number, because it is equal to n+sod(n) for n = 105990497 and 105990506.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (105990641) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52995270 + 52995271.
It is an arithmetic number, because the mean of its divisors is an integer number (52995271).
Almost surely, 2105990541 is an apocalyptic number.
It is an amenable number.
105990541 is a deficient number, since it is larger than the sum of its proper divisors (1).
105990541 is an equidigital number, since it uses as much as digits as its factorization.
105990541 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8100, while the sum is 34.
The square root of 105990541 is about 10295.1707610899. The cubic root of 105990541 is about 473.2482713751.
The spelling of 105990541 in words is "one hundred five million, nine hundred ninety thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •