Base | Representation |
---|---|
bin | 11101111000111111001… |
… | …110111010110101111011 |
3 | 21021100212122022201100222 |
4 | 131320333032322311323 |
5 | 232123201120240011 |
6 | 4211341524250255 |
7 | 301254255330053 |
oct | 35707716726573 |
9 | 7240778281328 |
10 | 2054055243131 |
11 | 7221356aa041 |
12 | 29210ab4098b |
13 | 11b9094c8538 |
14 | 715b99d4563 |
15 | 3866d8aaddb |
hex | 1de3f3bad7b |
2054055243131 has 2 divisors, whose sum is σ = 2054055243132. Its totient is φ = 2054055243130.
The previous prime is 2054055243113. The next prime is 2054055243151. The reversal of 2054055243131 is 1313425504502.
Together with previous prime (2054055243113) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 2054055243131 - 226 = 2053988134267 is a prime.
It is a super-2 number, since 2×20540552431312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2054055243091 and 2054055243100.
It is not a weakly prime, because it can be changed into another prime (2054055243101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1027027621565 + 1027027621566.
It is an arithmetic number, because the mean of its divisors is an integer number (1027027621566).
Almost surely, 22054055243131 is an apocalyptic number.
2054055243131 is a deficient number, since it is larger than the sum of its proper divisors (1).
2054055243131 is an equidigital number, since it uses as much as digits as its factorization.
2054055243131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72000, while the sum is 35.
The spelling of 2054055243131 in words is "two trillion, fifty-four billion, fifty-five million, two hundred forty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •