Base | Representation |
---|---|
bin | 11010010011011… |
… | …011111110111001 |
3 | 1010202101111212102 |
4 | 122103123332321 |
5 | 1400433143334 |
6 | 111442353145 |
7 | 13636004402 |
oct | 3223337671 |
9 | 1122344772 |
10 | 441302969 |
11 | 2071164a8 |
12 | 10395b7b5 |
13 | 70573223 |
14 | 428769a9 |
15 | 28b2167e |
hex | 1a4dbfb9 |
441302969 has 2 divisors, whose sum is σ = 441302970. Its totient is φ = 441302968.
The previous prime is 441302933. The next prime is 441302971. The reversal of 441302969 is 969203144.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 407232400 + 34070569 = 20180^2 + 5837^2 .
It is a cyclic number.
It is not a de Polignac number, because 441302969 - 212 = 441298873 is a prime.
It is a super-2 number, since 2×4413029692 = 389496620896429922, which contains 22 as substring.
It is a Sophie Germain prime.
Together with 441302971, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (441301969) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 220651484 + 220651485.
It is an arithmetic number, because the mean of its divisors is an integer number (220651485).
Almost surely, 2441302969 is an apocalyptic number.
It is an amenable number.
441302969 is a deficient number, since it is larger than the sum of its proper divisors (1).
441302969 is an equidigital number, since it uses as much as digits as its factorization.
441302969 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 46656, while the sum is 38.
The square root of 441302969 is about 21007.2123091095. The cubic root of 441302969 is about 761.3405294249.
The spelling of 441302969 in words is "four hundred forty-one million, three hundred two thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •