Base | Representation |
---|---|
bin | 11101111000010100010… |
… | …000100011001000101111 |
3 | 21021022000101122110202211 |
4 | 131320110100203020233 |
5 | 232120212032000111 |
6 | 4211142211031251 |
7 | 301230352102261 |
oct | 35702420431057 |
9 | 7238011573684 |
10 | 2053334250031 |
11 | 7218a5721279 |
12 | 291b4959b527 |
13 | 11b8230189bc |
14 | 7154bd53b31 |
15 | 3862a43d521 |
hex | 1de1442322f |
2053334250031 has 2 divisors, whose sum is σ = 2053334250032. Its totient is φ = 2053334250030.
The previous prime is 2053334249971. The next prime is 2053334250161. The reversal of 2053334250031 is 1300524333502.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 2053334250031 - 217 = 2053334118959 is a prime.
It is a super-2 number, since 2×20533342500312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2053334249975 and 2053334250002.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2053334250931) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1026667125015 + 1026667125016.
It is an arithmetic number, because the mean of its divisors is an integer number (1026667125016).
Almost surely, 22053334250031 is an apocalyptic number.
2053334250031 is a deficient number, since it is larger than the sum of its proper divisors (1).
2053334250031 is an equidigital number, since it uses as much as digits as its factorization.
2053334250031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32400, while the sum is 31.
Adding to 2053334250031 its reverse (1300524333502), we get a palindrome (3353858583533).
The spelling of 2053334250031 in words is "two trillion, fifty-three billion, three hundred thirty-four million, two hundred fifty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •