Base | Representation |
---|---|
bin | 11010100010010… |
… | …101101011111101 |
3 | 1011000201222101212 |
4 | 122202111223331 |
5 | 1402433144331 |
6 | 112102214205 |
7 | 14014134263 |
oct | 3242255375 |
9 | 1130658355 |
10 | 445209341 |
11 | 209344405 |
12 | 105124365 |
13 | 713102a5 |
14 | 431b2433 |
15 | 29143d2b |
hex | 1a895afd |
445209341 has 2 divisors, whose sum is σ = 445209342. Its totient is φ = 445209340.
The previous prime is 445209299. The next prime is 445209361. The reversal of 445209341 is 143902544.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 390892441 + 54316900 = 19771^2 + 7370^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-445209341 is a prime.
It is a super-2 number, since 2×4452093412 = 396422714627308562, which contains 22 as substring.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 445209298 and 445209307.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (445209361) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 222604670 + 222604671.
It is an arithmetic number, because the mean of its divisors is an integer number (222604671).
Almost surely, 2445209341 is an apocalyptic number.
It is an amenable number.
445209341 is a deficient number, since it is larger than the sum of its proper divisors (1).
445209341 is an equidigital number, since it uses as much as digits as its factorization.
445209341 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 17280, while the sum is 32.
The square root of 445209341 is about 21099.9843838805. The cubic root of 445209341 is about 763.5803714490.
The spelling of 445209341 in words is "four hundred forty-five million, two hundred nine thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •