Base | Representation |
---|---|
bin | 1000010001101010… |
… | …01101000101010001 |
3 | 102110122112111121101 |
4 | 10020311031011101 |
5 | 33044420212431 |
6 | 2012515424401 |
7 | 215051000212 |
oct | 41065150521 |
9 | 12418474541 |
10 | 4443132241 |
11 | 198003a019 |
12 | a3bbb5101 |
13 | 55a685442 |
14 | 302145409 |
15 | 1b0108961 |
hex | 108d4d151 |
4443132241 has 2 divisors, whose sum is σ = 4443132242. Its totient is φ = 4443132240.
The previous prime is 4443132233. The next prime is 4443132259. The reversal of 4443132241 is 1422313444.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4332272400 + 110859841 = 65820^2 + 10529^2 .
It is a cyclic number.
It is not a de Polignac number, because 4443132241 - 23 = 4443132233 is a prime.
It is a super-2 number, since 2×44431322412 = 39482848222027364162, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (4443132271) 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, 2221566120 + 2221566121.
It is an arithmetic number, because the mean of its divisors is an integer number (2221566121).
Almost surely, 24443132241 is an apocalyptic number.
It is an amenable number.
4443132241 is a deficient number, since it is larger than the sum of its proper divisors (1).
4443132241 is an equidigital number, since it uses as much as digits as its factorization.
4443132241 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 9216, while the sum is 28.
The square root of 4443132241 is about 66656.8244143088. The cubic root of 4443132241 is about 1643.9795583610.
Adding to 4443132241 its reverse (1422313444), we get a palindrome (5865445685).
The spelling of 4443132241 in words is "four billion, four hundred forty-three million, one hundred thirty-two thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •