Base | Representation |
---|---|
bin | 1111000000111111… |
… | …0000111000011101 |
3 | 101101220101221212001 |
4 | 3300033300320131 |
5 | 31223322223341 |
6 | 1503543042301 |
7 | 201612036433 |
oct | 36017607035 |
9 | 11356357761 |
10 | 4030664221 |
11 | 1789228761 |
12 | 945a40391 |
13 | 4c3099b1c |
14 | 2a3456d53 |
15 | 188cd0d31 |
hex | f03f0e1d |
4030664221 has 2 divisors, whose sum is σ = 4030664222. Its totient is φ = 4030664220.
The previous prime is 4030664219. The next prime is 4030664273. The reversal of 4030664221 is 1224660304.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4015756900 + 14907321 = 63370^2 + 3861^2 .
It is a cyclic number.
It is not a de Polignac number, because 4030664221 - 21 = 4030664219 is a prime.
Together with 4030664219, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 4030664221.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4030664321) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2015332110 + 2015332111.
It is an arithmetic number, because the mean of its divisors is an integer number (2015332111).
Almost surely, 24030664221 is an apocalyptic number.
It is an amenable number.
4030664221 is a deficient number, since it is larger than the sum of its proper divisors (1).
4030664221 is an equidigital number, since it uses as much as digits as its factorization.
4030664221 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 28.
The square root of 4030664221 is about 63487.5123232908. The cubic root of 4030664221 is about 1591.4470984983.
The spelling of 4030664221 in words is "four billion, thirty million, six hundred sixty-four thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •