Base | Representation |
---|---|
bin | 1100101000010… |
… | …10100010111101 |
3 | 21101100210012212 |
4 | 12110022202331 |
5 | 204110334443 |
6 | 14302510205 |
7 | 2424361205 |
oct | 624124275 |
9 | 241323185 |
10 | 105949373 |
11 | 54895372 |
12 | 2b595365 |
13 | 18c4774a |
14 | 100dd405 |
15 | 947c618 |
hex | 650a8bd |
105949373 has 2 divisors, whose sum is σ = 105949374. Its totient is φ = 105949372.
The previous prime is 105949343. The next prime is 105949379. The reversal of 105949373 is 373949501.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 85137529 + 20811844 = 9227^2 + 4562^2 .
It is a cyclic number.
It is not a de Polignac number, because 105949373 - 214 = 105932989 is a prime.
It is a super-2 number, since 2×1059493732 = 22450539278186258, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 105949373.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (105949379) 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, 52974686 + 52974687.
It is an arithmetic number, because the mean of its divisors is an integer number (52974687).
Almost surely, 2105949373 is an apocalyptic number.
It is an amenable number.
105949373 is a deficient number, since it is larger than the sum of its proper divisors (1).
105949373 is an equidigital number, since it uses as much as digits as its factorization.
105949373 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 102060, while the sum is 41.
The square root of 105949373 is about 10293.1711828765. The cubic root of 105949373 is about 473.1869916683.
The spelling of 105949373 in words is "one hundred five million, nine hundred forty-nine thousand, three hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •