Base | Representation |
---|---|
bin | 11101101100001000100… |
… | …100110000111101100101 |
3 | 21020001020202120102122002 |
4 | 131230020210300331211 |
5 | 231411414322233221 |
6 | 4201140205215045 |
7 | 300255244042154 |
oct | 35541044607545 |
9 | 7201222512562 |
10 | 2040253321061 |
11 | 7172a28a077a |
12 | 28b4b8861485 |
13 | 11a519c4cb47 |
14 | 70a6a95d59b |
15 | 38111d5280b |
hex | 1db08930f65 |
2040253321061 has 2 divisors, whose sum is σ = 2040253321062. Its totient is φ = 2040253321060.
The previous prime is 2040253321049. The next prime is 2040253321069. The reversal of 2040253321061 is 1601233520402.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1221038260036 + 819215061025 = 1105006^2 + 905105^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2040253321061 is a prime.
It is a super-2 number, since 2×20402533210612 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2040253321069) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1020126660530 + 1020126660531.
It is an arithmetic number, because the mean of its divisors is an integer number (1020126660531).
Almost surely, 22040253321061 is an apocalyptic number.
It is an amenable number.
2040253321061 is a deficient number, since it is larger than the sum of its proper divisors (1).
2040253321061 is an equidigital number, since it uses as much as digits as its factorization.
2040253321061 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8640, while the sum is 29.
Adding to 2040253321061 its reverse (1601233520402), we get a palindrome (3641486841463).
The spelling of 2040253321061 in words is "two trillion, forty billion, two hundred fifty-three million, three hundred twenty-one thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •