Base | Representation |
---|---|
bin | 100100111101100… |
… | …1000111110010101 |
3 | 10012102201201110121 |
4 | 1021323020332111 |
5 | 10020000140041 |
6 | 323022351541 |
7 | 42506603056 |
oct | 11173107625 |
9 | 3172651417 |
10 | 1240240021 |
11 | 5870a0759 |
12 | 2a742b5b1 |
13 | 169c43347 |
14 | baa0672d |
15 | 73d387d1 |
hex | 49ec8f95 |
1240240021 has 2 divisors, whose sum is σ = 1240240022. Its totient is φ = 1240240020.
The previous prime is 1240240007. The next prime is 1240240031. The reversal of 1240240021 is 1200420421.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1163764996 + 76475025 = 34114^2 + 8745^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1240240021 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1240239977 and 1240240004.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1240240031) 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, 620120010 + 620120011.
It is an arithmetic number, because the mean of its divisors is an integer number (620120011).
Almost surely, 21240240021 is an apocalyptic number.
It is an amenable number.
1240240021 is a deficient number, since it is larger than the sum of its proper divisors (1).
1240240021 is an equidigital number, since it uses as much as digits as its factorization.
1240240021 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 1240240021 is about 35217.0416275984. The cubic root of 1240240021 is about 1074.4063846508.
Adding to 1240240021 its reverse (1200420421), we get a palindrome (2440660442).
The spelling of 1240240021 in words is "one billion, two hundred forty million, two hundred forty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •