Base | Representation |
---|---|
bin | 1000000100011101… |
… | …11101001000011101 |
3 | 102011221020212100001 |
4 | 10002032331020131 |
5 | 32333101122031 |
6 | 1553523134301 |
7 | 212235102436 |
oct | 40216751035 |
9 | 12157225301 |
10 | 4332442141 |
11 | 19236069a5 |
12 | a0ab14391 |
13 | 54076ac41 |
14 | 2d157048d |
15 | 1a5541861 |
hex | 1023bd21d |
4332442141 has 2 divisors, whose sum is σ = 4332442142. Its totient is φ = 4332442140.
The previous prime is 4332442139. The next prime is 4332442159. The reversal of 4332442141 is 1412442334.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2563903225 + 1768538916 = 50635^2 + 42054^2 .
It is a cyclic number.
It is not a de Polignac number, because 4332442141 - 21 = 4332442139 is a prime.
It is a super-2 number, since 2×43324421412 = 37540109810225327762, which contains 22 as substring.
Together with 4332442139, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4332442171) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2166221070 + 2166221071.
It is an arithmetic number, because the mean of its divisors is an integer number (2166221071).
Almost surely, 24332442141 is an apocalyptic number.
It is an amenable number.
4332442141 is a deficient number, since it is larger than the sum of its proper divisors (1).
4332442141 is an equidigital number, since it uses as much as digits as its factorization.
4332442141 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 4332442141 is about 65821.2894206730. The cubic root of 4332442141 is about 1630.2126437926.
Adding to 4332442141 its reverse (1412442334), we get a palindrome (5744884475).
The spelling of 4332442141 in words is "four billion, three hundred thirty-two million, four hundred forty-two thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •