Base | Representation |
---|---|
bin | 11111001001000101000… |
… | …111101111000110111101 |
3 | 21120120211222222011121011 |
4 | 133021011013233012331 |
5 | 240030312130304102 |
6 | 4315043230435221 |
7 | 310420342333645 |
oct | 37110507570675 |
9 | 7516758864534 |
10 | 2140053369277 |
11 | 75565637706a |
12 | 2a690b662b11 |
13 | 126a631c1205 |
14 | 75817211525 |
15 | 3aa037422d7 |
hex | 1f2451ef1bd |
2140053369277 has 2 divisors, whose sum is σ = 2140053369278. Its totient is φ = 2140053369276.
The previous prime is 2140053369263. The next prime is 2140053369319. The reversal of 2140053369277 is 7729633500412.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1345493282116 + 794560087161 = 1159954^2 + 891381^2 .
It is a cyclic number.
It is not a de Polignac number, because 2140053369277 - 211 = 2140053367229 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2140053369277.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2140053369217) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1070026684638 + 1070026684639.
It is an arithmetic number, because the mean of its divisors is an integer number (1070026684639).
Almost surely, 22140053369277 is an apocalyptic number.
It is an amenable number.
2140053369277 is a deficient number, since it is larger than the sum of its proper divisors (1).
2140053369277 is an equidigital number, since it uses as much as digits as its factorization.
2140053369277 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1905120, while the sum is 49.
Adding to 2140053369277 its reverse (7729633500412), we get a palindrome (9869686869689).
The spelling of 2140053369277 in words is "two trillion, one hundred forty billion, fifty-three million, three hundred sixty-nine thousand, two hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •