Base | Representation |
---|---|
bin | 111010000000110100100010… |
… | …000010001010011001111111 |
3 | 1020110101102221112211210021101 |
4 | 322000310202002022121333 |
5 | 231420231033410224020 |
6 | 2302351042401513531 |
7 | 104512323643031146 |
oct | 7200644202123177 |
9 | 1213342845753241 |
10 | 255143103211135 |
11 | 74329645217537 |
12 | 247485390428a7 |
13 | ac49b785188b9 |
14 | 4700dc63d475d |
15 | 1e76cce7c200a |
hex | e80d2208a67f |
255143103211135 has 8 divisors (see below), whose sum is σ = 306172350097920. Its totient is φ = 204114065072544.
The previous prime is 255143103211097. The next prime is 255143103211153. The reversal of 255143103211135 is 531112301341552.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 255143103211135 - 211 = 255143103209087 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 255143103211094 and 255143103211103.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 49485375 + ... + 54397504.
It is an arithmetic number, because the mean of its divisors is an integer number (38271543762240).
Almost surely, 2255143103211135 is an apocalyptic number.
255143103211135 is a deficient number, since it is larger than the sum of its proper divisors (51029246886785).
255143103211135 is a wasteful number, since it uses less digits than its factorization.
255143103211135 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 104374097.
The product of its (nonzero) digits is 54000, while the sum is 37.
Adding to 255143103211135 its reverse (531112301341552), we get a palindrome (786255404552687).
The spelling of 255143103211135 in words is "two hundred fifty-five trillion, one hundred forty-three billion, one hundred three million, two hundred eleven thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •