Base | Representation |
---|---|
bin | 111010000000101001011001… |
… | …101010100000001010110010 |
3 | 1020110100022002121211121112020 |
4 | 322000221121222200022302 |
5 | 231420032044304143101 |
6 | 2302341344422012310 |
7 | 104511421530211236 |
oct | 7200513152401262 |
9 | 1213308077747466 |
10 | 255131151631026 |
11 | 74324571927500 |
12 | 24746162577096 |
13 | ac489c24081c8 |
14 | 47005b0dbc5c6 |
15 | 1e76830418136 |
hex | e80a59aa02b2 |
255131151631026 has 96 divisors (see below), whose sum is σ = 569816502097920. Its totient is φ = 76085181675360.
The previous prime is 255131151630959. The next prime is 255131151631249. The reversal of 255131151631026 is 620136151131552.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 10362795 + ... + 24852561.
It is an arithmetic number, because the mean of its divisors is an integer number (5935588563520).
Almost surely, 2255131151631026 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 255131151631026, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (284908251048960).
255131151631026 is an abundant number, since it is smaller than the sum of its proper divisors (314685350466894).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
255131151631026 is a wasteful number, since it uses less digits than its factorization.
255131151631026 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14490180 (or 14490169 counting only the distinct ones).
The product of its (nonzero) digits is 162000, while the sum is 42.
The spelling of 255131151631026 in words is "two hundred fifty-five trillion, one hundred thirty-one billion, one hundred fifty-one million, six hundred thirty-one thousand, twenty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •