Base | Representation |
---|---|
bin | 11111001101110011011… |
… | …010101011001110010101 |
3 | 21121001221110020102012101 |
4 | 133031303122223032111 |
5 | 240121204003201313 |
6 | 4321242402322101 |
7 | 310660125050563 |
oct | 37156332531625 |
9 | 7531843212171 |
10 | 2145125053333 |
11 | 757819195399 |
12 | 2a78a6059331 |
13 | 127390b5acb2 |
14 | 75b78a12a33 |
15 | 3abedb085dd |
hex | 1f3736ab395 |
2145125053333 has 2 divisors, whose sum is σ = 2145125053334. Its totient is φ = 2145125053332.
The previous prime is 2145125053289. The next prime is 2145125053367. The reversal of 2145125053333 is 3333505215412.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1425881974609 + 719243078724 = 1194103^2 + 848082^2 .
It is a cyclic number.
It is not a de Polignac number, because 2145125053333 - 29 = 2145125052821 is a prime.
It is a super-2 number, since 2×21451250533332 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2145125053292 and 2145125053301.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2145125053733) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1072562526666 + 1072562526667.
It is an arithmetic number, because the mean of its divisors is an integer number (1072562526667).
Almost surely, 22145125053333 is an apocalyptic number.
It is an amenable number.
2145125053333 is a deficient number, since it is larger than the sum of its proper divisors (1).
2145125053333 is an equidigital number, since it uses as much as digits as its factorization.
2145125053333 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 162000, while the sum is 37.
The spelling of 2145125053333 in words is "two trillion, one hundred forty-five billion, one hundred twenty-five million, fifty-three thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •