Base | Representation |
---|---|
bin | 1110111011101100001… |
… | …0110101011101110001 |
3 | 220112011210102212100021 |
4 | 3232323002311131301 |
5 | 13200344013400022 |
6 | 313504155123441 |
7 | 24351220552033 |
oct | 3567302653561 |
9 | 815153385307 |
10 | 256541153137 |
11 | 9988687a435 |
12 | 41877143581 |
13 | 1b2652bb3c9 |
14 | c5b9449c53 |
15 | 6a171e87c7 |
hex | 3bbb0b5771 |
256541153137 has 2 divisors, whose sum is σ = 256541153138. Its totient is φ = 256541153136.
The previous prime is 256541153059. The next prime is 256541153237. The reversal of 256541153137 is 731351145652.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 207397357281 + 49143795856 = 455409^2 + 221684^2 .
It is a cyclic number.
It is not a de Polignac number, because 256541153137 - 231 = 254393669489 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 256541153093 and 256541153102.
It is not a weakly prime, because it can be changed into another prime (256541153237) 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, 128270576568 + 128270576569.
It is an arithmetic number, because the mean of its divisors is an integer number (128270576569).
Almost surely, 2256541153137 is an apocalyptic number.
It is an amenable number.
256541153137 is a deficient number, since it is larger than the sum of its proper divisors (1).
256541153137 is an equidigital number, since it uses as much as digits as its factorization.
256541153137 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 378000, while the sum is 43.
Adding to 256541153137 its reverse (731351145652), we get a palindrome (987892298789).
The spelling of 256541153137 in words is "two hundred fifty-six billion, five hundred forty-one million, one hundred fifty-three thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •