Base | Representation |
---|---|
bin | 1110110111011111010… |
… | …1001110010010100011 |
3 | 220102021012120201120221 |
4 | 3231313311032102203 |
5 | 13141041324330311 |
6 | 313200233543511 |
7 | 24311246011426 |
oct | 3556765162243 |
9 | 812235521527 |
10 | 255413511331 |
11 | 993582a5460 |
12 | 41601574b97 |
13 | 1b1157acc34 |
14 | c50d7939bd |
15 | 699d202671 |
hex | 3b77d4e4a3 |
255413511331 has 4 divisors (see below), whose sum is σ = 278632921464. Its totient is φ = 232194101200.
The previous prime is 255413511319. The next prime is 255413511403. The reversal of 255413511331 is 133115314552.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 255413511331 - 227 = 255279293603 is a prime.
It is a super-2 number, since 2×2554135113312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (255413211331) 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 in 3 ways as a sum of consecutive naturals, for example, 11609705050 + ... + 11609705071.
It is an arithmetic number, because the mean of its divisors is an integer number (69658230366).
Almost surely, 2255413511331 is an apocalyptic number.
255413511331 is a deficient number, since it is larger than the sum of its proper divisors (23219410133).
255413511331 is a wasteful number, since it uses less digits than its factorization.
255413511331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23219410132.
The product of its digits is 27000, while the sum is 34.
Adding to 255413511331 its reverse (133115314552), we get a palindrome (388528825883).
The spelling of 255413511331 in words is "two hundred fifty-five billion, four hundred thirteen million, five hundred eleven thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •