Base | Representation |
---|---|
bin | 1110111110101111… |
… | …0001101010001101 |
3 | 101101020122122211122 |
4 | 3233223301222031 |
5 | 31213413331341 |
6 | 1503004530325 |
7 | 201435615161 |
oct | 35753615215 |
9 | 11336578748 |
10 | 4021230221 |
11 | 1783974868 |
12 | 9428509a5 |
13 | 4c1145a88 |
14 | 2a20bcca1 |
15 | 18806a94b |
hex | efaf1a8d |
4021230221 has 2 divisors, whose sum is σ = 4021230222. Its totient is φ = 4021230220.
The previous prime is 4021230203. The next prime is 4021230223. The reversal of 4021230221 is 1220321204.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3258697225 + 762532996 = 57085^2 + 27614^2 .
It is a cyclic number.
It is not a de Polignac number, because 4021230221 - 226 = 3954121357 is a prime.
Together with 4021230223, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 4021230221.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4021230223) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2010615110 + 2010615111.
It is an arithmetic number, because the mean of its divisors is an integer number (2010615111).
Almost surely, 24021230221 is an apocalyptic number.
It is an amenable number.
4021230221 is a deficient number, since it is larger than the sum of its proper divisors (1).
4021230221 is an equidigital number, since it uses as much as digits as its factorization.
4021230221 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 192, while the sum is 17.
The square root of 4021230221 is about 63413.1707218619. The cubic root of 4021230221 is about 1590.2045042391.
Adding to 4021230221 its reverse (1220321204), we get a palindrome (5241551425).
The spelling of 4021230221 in words is "four billion, twenty-one million, two hundred thirty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •