Base | Representation |
---|---|
bin | 111010000101000101100001… |
… | …010111010100111111100101 |
3 | 1020111102110112121101021220001 |
4 | 322011011201113110333211 |
5 | 231440031341204002021 |
6 | 2303133440414541301 |
7 | 104542441512261436 |
oct | 7205054127247745 |
9 | 1214373477337801 |
10 | 255436223500261 |
11 | 74431991a59171 |
12 | 24795302507831 |
13 | ac6b6bcc39c6b |
14 | 471127196d48d |
15 | 1e7e737ec8091 |
hex | e851615d4fe5 |
255436223500261 has 4 divisors (see below), whose sum is σ = 260871036766272. Its totient is φ = 250001410234252.
The previous prime is 255436223500253. The next prime is 255436223500277. The reversal of 255436223500261 is 162005322634552.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 255436223500261 - 23 = 255436223500253 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (255436223570261) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2717406632935 + ... + 2717406633028.
It is an arithmetic number, because the mean of its divisors is an integer number (65217759191568).
Almost surely, 2255436223500261 is an apocalyptic number.
It is an amenable number.
255436223500261 is a deficient number, since it is larger than the sum of its proper divisors (5434813266011).
255436223500261 is an equidigital number, since it uses as much as digits as its factorization.
255436223500261 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5434813266010.
The product of its (nonzero) digits is 2592000, while the sum is 46.
The spelling of 255436223500261 in words is "two hundred fifty-five trillion, four hundred thirty-six billion, two hundred twenty-three million, five hundred thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •