Base | Representation |
---|---|
bin | 111110001110101… |
… | …101011010011101 |
3 | 2200202112220022212 |
4 | 332032231122131 |
5 | 4114233342141 |
6 | 251333250205 |
7 | 34605136241 |
oct | 7616553235 |
9 | 2622486285 |
10 | 1044043421 |
11 | 496376303 |
12 | 251793965 |
13 | 1383bb295 |
14 | 9c934421 |
15 | 619d12eb |
hex | 3e3ad69d |
1044043421 has 2 divisors, whose sum is σ = 1044043422. Its totient is φ = 1044043420.
The previous prime is 1044043391. The next prime is 1044043453. The reversal of 1044043421 is 1243404401.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 867950521 + 176092900 = 29461^2 + 13270^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1044043421 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1044043921) 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, 522021710 + 522021711.
It is an arithmetic number, because the mean of its divisors is an integer number (522021711).
Almost surely, 21044043421 is an apocalyptic number.
It is an amenable number.
1044043421 is a deficient number, since it is larger than the sum of its proper divisors (1).
1044043421 is an equidigital number, since it uses as much as digits as its factorization.
1044043421 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1536, while the sum is 23.
The square root of 1044043421 is about 32311.6607589273. The cubic root of 1044043421 is about 1014.4707282897.
Adding to 1044043421 its reverse (1243404401), we get a palindrome (2287447822).
The spelling of 1044043421 in words is "one billion, forty-four million, forty-three thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •