Base | Representation |
---|---|
bin | 1110110111111001011… |
… | …0111010001001111110 |
3 | 220102112211121120202000 |
4 | 3231332112322021332 |
5 | 13141302342130204 |
6 | 313215144443130 |
7 | 24314045464212 |
oct | 3557626721176 |
9 | 812484546660 |
10 | 255523005054 |
11 | 99404090739 |
12 | 416321794a6 |
13 | 1b132398a15 |
14 | c520136942 |
15 | 69a7b30039 |
hex | 3b7e5ba27e |
255523005054 has 64 divisors (see below), whose sum is σ = 581741568000. Its totient is φ = 83098881504.
The previous prime is 255523005013. The next prime is 255523005061. The reversal of 255523005054 is 450500325552.
255523005054 is a `hidden beast` number, since 2 + 5 + 552 + 3 + 0 + 0 + 50 + 54 = 666.
It is a super-2 number, since 2×2555230050542 (a number of 24 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 645747 + ... + 963345.
It is an arithmetic number, because the mean of its divisors is an integer number (9089712000).
Almost surely, 2255523005054 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 255523005054, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (290870784000).
255523005054 is an abundant number, since it is smaller than the sum of its proper divisors (326218562946).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
255523005054 is a wasteful number, since it uses less digits than its factorization.
255523005054 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 317974 (or 317968 counting only the distinct ones).
The product of its (nonzero) digits is 150000, while the sum is 36.
The spelling of 255523005054 in words is "two hundred fifty-five billion, five hundred twenty-three million, five thousand, fifty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.029 sec. • engine limits •