Base | Representation |
---|---|
bin | 11101011110000011010… |
… | …010010110101010011101 |
3 | 21011121012221120001211002 |
4 | 131132003102112222131 |
5 | 231134432322120013 |
6 | 4150155523440045 |
7 | 266211443606435 |
oct | 35360322265235 |
9 | 7147187501732 |
10 | 2025132223133 |
11 | 710943388028 |
12 | 288598826025 |
13 | 118c7a2b4216 |
14 | 700346152c5 |
15 | 37a295bc358 |
hex | 1d783496a9d |
2025132223133 has 2 divisors, whose sum is σ = 2025132223134. Its totient is φ = 2025132223132.
The previous prime is 2025132223111. The next prime is 2025132223141. The reversal of 2025132223133 is 3313222315202.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1752650311129 + 272481912004 = 1323877^2 + 521998^2 .
It is a cyclic number.
It is not a de Polignac number, because 2025132223133 - 216 = 2025132157597 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2025132223096 and 2025132223105.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2025132223193) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1012566111566 + 1012566111567.
It is an arithmetic number, because the mean of its divisors is an integer number (1012566111567).
Almost surely, 22025132223133 is an apocalyptic number.
It is an amenable number.
2025132223133 is a deficient number, since it is larger than the sum of its proper divisors (1).
2025132223133 is an equidigital number, since it uses as much as digits as its factorization.
2025132223133 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 12960, while the sum is 29.
Adding to 2025132223133 its reverse (3313222315202), we get a palindrome (5338354538335).
The spelling of 2025132223133 in words is "two trillion, twenty-five billion, one hundred thirty-two million, two hundred twenty-three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •