Base | Representation |
---|---|
bin | 111001111110111010101000… |
… | …010111101000111100100111 |
3 | 1020102220221002120211020022201 |
4 | 321332322220113220330213 |
5 | 231411110003012031043 |
6 | 2302210554322235331 |
7 | 104500011236434021 |
oct | 7176725027507447 |
9 | 1212827076736281 |
10 | 255012213002023 |
11 | 742890880a30a4 |
12 | 247270aa1b5b47 |
13 | ac3a719098019 |
14 | 46d892a9db011 |
15 | 1e736bd717c4d |
hex | e7eea85e8f27 |
255012213002023 has 2 divisors, whose sum is σ = 255012213002024. Its totient is φ = 255012213002022.
The previous prime is 255012213002009. The next prime is 255012213002081. The reversal of 255012213002023 is 320200312210552.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-255012213002023 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 255012213001982 and 255012213002000.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (255012213002083) 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, 127506106501011 + 127506106501012.
It is an arithmetic number, because the mean of its divisors is an integer number (127506106501012).
Almost surely, 2255012213002023 is an apocalyptic number.
255012213002023 is a deficient number, since it is larger than the sum of its proper divisors (1).
255012213002023 is an equidigital number, since it uses as much as digits as its factorization.
255012213002023 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7200, while the sum is 28.
Adding to 255012213002023 its reverse (320200312210552), we get a palindrome (575212525212575).
The spelling of 255012213002023 in words is "two hundred fifty-five trillion, twelve billion, two hundred thirteen million, two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •