Base | Representation |
---|---|
bin | 1110110111110110100… |
… | …1101001111111000101 |
3 | 220102112000021220011021 |
4 | 3231331221221333011 |
5 | 13141241323023331 |
6 | 313214042311141 |
7 | 24313542606100 |
oct | 3557551517705 |
9 | 812460256137 |
10 | 255511142341 |
11 | 993a8419044 |
12 | 4162a1b84b1 |
13 | 1b12caa4370 |
14 | c51c729737 |
15 | 69a6a8a211 |
hex | 3b7da69fc5 |
255511142341 has 12 divisors (see below), whose sum is σ = 320090882412. Its totient is φ = 202162661568.
The previous prime is 255511142339. The next prime is 255511142347. The reversal of 255511142341 is 143241115552.
It can be written as a sum of positive squares in 2 ways, for example, as 48167519841 + 207343622500 = 219471^2 + 455350^2 .
It is not a de Polignac number, because 255511142341 - 21 = 255511142339 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 255511142297 and 255511142306.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (255511142347) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 200557560 + ... + 200558833.
It is an arithmetic number, because the mean of its divisors is an integer number (26674240201).
Almost surely, 2255511142341 is an apocalyptic number.
It is an amenable number.
255511142341 is a deficient number, since it is larger than the sum of its proper divisors (64579740071).
255511142341 is a wasteful number, since it uses less digits than its factorization.
255511142341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 401116420 (or 401116413 counting only the distinct ones).
The product of its digits is 24000, while the sum is 34.
Adding to 255511142341 its reverse (143241115552), we get a palindrome (398752257893).
The spelling of 255511142341 in words is "two hundred fifty-five billion, five hundred eleven million, one hundred forty-two thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •