Base | Representation |
---|---|
bin | 1110111110101011… |
… | …1110101001101101 |
3 | 101101020021001020120 |
4 | 3233222332221231 |
5 | 31213340140133 |
6 | 1503000235153 |
7 | 201434055102 |
oct | 35752765155 |
9 | 11336231216 |
10 | 4021021293 |
11 | 17838418a3 |
12 | 94276bab9 |
13 | 4c10a1953 |
14 | 2a2066aa9 |
15 | 188028ab3 |
hex | efabea6d |
4021021293 has 4 divisors (see below), whose sum is σ = 5361361728. Its totient is φ = 2680680860.
The previous prime is 4021021273. The next prime is 4021021297. The reversal of 4021021293 is 3921201204.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 4021021293 - 217 = 4020890221 is a prime.
It is a super-2 number, since 2×40210212932 = 32337224477518783698, which contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4021021297) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 670170213 + ... + 670170218.
It is an arithmetic number, because the mean of its divisors is an integer number (1340340432).
Almost surely, 24021021293 is an apocalyptic number.
It is an amenable number.
4021021293 is a deficient number, since it is larger than the sum of its proper divisors (1340340435).
4021021293 is a wasteful number, since it uses less digits than its factorization.
4021021293 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1340340434.
The product of its (nonzero) digits is 864, while the sum is 24.
The square root of 4021021293 is about 63411.5233455245. The cubic root of 4021021293 is about 1590.1769634135.
Adding to 4021021293 its reverse (3921201204), we get a palindrome (7942222497).
The spelling of 4021021293 in words is "four billion, twenty-one million, twenty-one thousand, two hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •