Base | Representation |
---|---|
bin | 11111001001011011001… |
… | …001111011011010100001 |
3 | 21120121210202120112020012 |
4 | 133021123021323122201 |
5 | 240032041244331341 |
6 | 4315144034054305 |
7 | 310432451450045 |
oct | 37113311733241 |
9 | 7517722515205 |
10 | 2140423042721 |
11 | 755826009207 |
12 | 2a69b341a395 |
13 | 126ac1974cb2 |
14 | 75850360025 |
15 | 3aa25e150eb |
hex | 1f25b27b6a1 |
2140423042721 has 2 divisors, whose sum is σ = 2140423042722. Its totient is φ = 2140423042720.
The previous prime is 2140423042697. The next prime is 2140423042733. The reversal of 2140423042721 is 1272403240412.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1970935210000 + 169487832721 = 1403900^2 + 411689^2 .
It is a cyclic number.
It is not a de Polignac number, because 2140423042721 - 218 = 2140422780577 is a prime.
It is a super-2 number, since 2×21404230427212 (a number of 25 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (2140423042921) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1070211521360 + 1070211521361.
It is an arithmetic number, because the mean of its divisors is an integer number (1070211521361).
Almost surely, 22140423042721 is an apocalyptic number.
It is an amenable number.
2140423042721 is a deficient number, since it is larger than the sum of its proper divisors (1).
2140423042721 is an equidigital number, since it uses as much as digits as its factorization.
2140423042721 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 21504, while the sum is 32.
The spelling of 2140423042721 in words is "two trillion, one hundred forty billion, four hundred twenty-three million, forty-two thousand, seven hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •