Base | Representation |
---|---|
bin | 1000010000100111… |
… | …01000001001101101 |
3 | 102110000222022111122 |
4 | 10020103220021231 |
5 | 33040142031341 |
6 | 2012003030325 |
7 | 214613120306 |
oct | 41023501155 |
9 | 12400868448 |
10 | 4434330221 |
11 | 1976077a22 |
12 | a3906b3a5 |
13 | 5588c2c49 |
14 | 300cd37ad |
15 | 1ae46a94b |
hex | 1084e826d |
4434330221 has 2 divisors, whose sum is σ = 4434330222. Its totient is φ = 4434330220.
The previous prime is 4434330209. The next prime is 4434330227. The reversal of 4434330221 is 1220334344.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3643933225 + 790396996 = 60365^2 + 28114^2 .
It is a cyclic number.
It is not a de Polignac number, because 4434330221 - 210 = 4434329197 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 (4434330227) 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, 2217165110 + 2217165111.
It is an arithmetic number, because the mean of its divisors is an integer number (2217165111).
Almost surely, 24434330221 is an apocalyptic number.
It is an amenable number.
4434330221 is a deficient number, since it is larger than the sum of its proper divisors (1).
4434330221 is an equidigital number, since it uses as much as digits as its factorization.
4434330221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6912, while the sum is 26.
The square root of 4434330221 is about 66590.7667848929. The cubic root of 4434330221 is about 1642.8932446124.
Adding to 4434330221 its reverse (1220334344), we get a palindrome (5654664565).
The spelling of 4434330221 in words is "four billion, four hundred thirty-four million, three hundred thirty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •