Base | Representation |
---|---|
bin | 1000001111000001… |
… | …10010001100100101 |
3 | 102102002220011122121 |
4 | 10013200302030211 |
5 | 33023234031041 |
6 | 2010405225541 |
7 | 214361616502 |
oct | 40740621445 |
9 | 12362804577 |
10 | 4421002021 |
11 | 19695a4287 |
12 | a347022b1 |
13 | 555c07537 |
14 | 2dd2244a9 |
15 | 1ad1d67d1 |
hex | 107832325 |
4421002021 has 2 divisors, whose sum is σ = 4421002022. Its totient is φ = 4421002020.
The previous prime is 4421002007. The next prime is 4421002051. The reversal of 4421002021 is 1202001244.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2651117121 + 1769884900 = 51489^2 + 42070^2 .
It is a cyclic number.
It is not a de Polignac number, because 4421002021 - 25 = 4421001989 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 4421001986 and 4421002004.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4421002051) 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, 2210501010 + 2210501011.
It is an arithmetic number, because the mean of its divisors is an integer number (2210501011).
Almost surely, 24421002021 is an apocalyptic number.
It is an amenable number.
4421002021 is a deficient number, since it is larger than the sum of its proper divisors (1).
4421002021 is an equidigital number, since it uses as much as digits as its factorization.
4421002021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 128, while the sum is 16.
The square root of 4421002021 is about 66490.6160371522. The cubic root of 4421002021 is about 1641.2455861791.
Adding to 4421002021 its reverse (1202001244), we get a palindrome (5623003265).
The spelling of 4421002021 in words is "four billion, four hundred twenty-one million, two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •