Base | Representation |
---|---|
bin | 1110110110011000011… |
… | …1010110111011101001 |
3 | 220101111111021120120222 |
4 | 3231212013112323221 |
5 | 13134434231303213 |
6 | 313110535055425 |
7 | 24301006363445 |
oct | 3554607267351 |
9 | 811444246528 |
10 | 255116275433 |
11 | 99215539758 |
12 | 41539b11575 |
13 | 1b09903c2c6 |
14 | c4c20dd825 |
15 | 698208c808 |
hex | 3b661d6ee9 |
255116275433 has 2 divisors, whose sum is σ = 255116275434. Its totient is φ = 255116275432.
The previous prime is 255116275411. The next prime is 255116275441. The reversal of 255116275433 is 334572611552.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 255097725184 + 18550249 = 505072^2 + 4307^2 .
It is a cyclic number.
It is not a de Polignac number, because 255116275433 - 26 = 255116275369 is a prime.
It is a super-3 number, since 3×2551162754333 (a number of 35 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (255116275483) 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, 127558137716 + 127558137717.
It is an arithmetic number, because the mean of its divisors is an integer number (127558137717).
Almost surely, 2255116275433 is an apocalyptic number.
It is an amenable number.
255116275433 is a deficient number, since it is larger than the sum of its proper divisors (1).
255116275433 is an equidigital number, since it uses as much as digits as its factorization.
255116275433 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 756000, while the sum is 44.
Adding to 255116275433 its reverse (334572611552), we get a palindrome (589688886985).
The spelling of 255116275433 in words is "two hundred fifty-five billion, one hundred sixteen million, two hundred seventy-five thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •