Base | Representation |
---|---|
bin | 111010000000110100101010… |
… | …011111001100100110001111 |
3 | 1020110101110022102201102220212 |
4 | 322000310222133030212033 |
5 | 231420231331212240030 |
6 | 2302351104425433035 |
7 | 104512330314406343 |
oct | 7200645237144617 |
9 | 1213343272642825 |
10 | 255143245040015 |
11 | 74329708288692 |
12 | 2474857863b77b |
13 | ac49b9ba16507 |
14 | 4700ddb193623 |
15 | 1e76cdbe8a595 |
hex | e80d2a7cc98f |
255143245040015 has 8 divisors (see below), whose sum is σ = 306175516476768. Its totient is φ = 204112181079520.
The previous prime is 255143245040003. The next prime is 255143245040087. The reversal of 255143245040015 is 510040542341552.
It is a happy number.
255143245040015 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 255143245040015 - 24 = 255143245039999 is a prime.
It is a Duffinian number.
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, 301404131 + ... + 302249460.
It is an arithmetic number, because the mean of its divisors is an integer number (38271939559596).
Almost surely, 2255143245040015 is an apocalyptic number.
255143245040015 is a deficient number, since it is larger than the sum of its proper divisors (51032271436753).
255143245040015 is an equidigital number, since it uses as much as digits as its factorization.
255143245040015 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 603738129.
The product of its (nonzero) digits is 480000, while the sum is 41.
Adding to 255143245040015 its reverse (510040542341552), we get a palindrome (765183787381567).
The spelling of 255143245040015 in words is "two hundred fifty-five trillion, one hundred forty-three billion, two hundred forty-five million, forty thousand, fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •