Base | Representation |
---|---|
bin | 1110110111110100111… |
… | …0101001001011001101 |
3 | 220102111111222010120022 |
4 | 3231331032221023031 |
5 | 13141233014424013 |
6 | 313213230431525 |
7 | 24313425454136 |
oct | 3557516511315 |
9 | 812444863508 |
10 | 255504061133 |
11 | 993a4421902 |
12 | 416279625a5 |
13 | 1b12b4951b9 |
14 | c51b804c8d |
15 | 69a613c008 |
hex | 3b7d3a92cd |
255504061133 has 2 divisors, whose sum is σ = 255504061134. Its totient is φ = 255504061132.
The previous prime is 255504061091. The next prime is 255504061171. The reversal of 255504061133 is 331160405552.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 255482735209 + 21325924 = 505453^2 + 4618^2 .
It is a cyclic number.
It is not a de Polignac number, because 255504061133 - 26 = 255504061069 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 255504061093 and 255504061102.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (255504061633) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 127752030566 + 127752030567.
It is an arithmetic number, because the mean of its divisors is an integer number (127752030567).
Almost surely, 2255504061133 is an apocalyptic number.
It is an amenable number.
255504061133 is a deficient number, since it is larger than the sum of its proper divisors (1).
255504061133 is an equidigital number, since it uses as much as digits as its factorization.
255504061133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 54000, while the sum is 35.
Adding to 255504061133 its reverse (331160405552), we get a palindrome (586664466685).
The spelling of 255504061133 in words is "two hundred fifty-five billion, five hundred four million, sixty-one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •