Base | Representation |
---|---|
bin | 1110111000010011010… |
… | …0110010111100001001 |
3 | 220102211101202212002122 |
4 | 3232010310302330021 |
5 | 13142013131044423 |
6 | 313234022141025 |
7 | 24316533632120 |
oct | 3560464627411 |
9 | 812741685078 |
10 | 255631503113 |
11 | 9945a356958 |
12 | 41662581775 |
13 | 1b14b9c655c |
14 | c5306daab7 |
15 | 69b24128c8 |
hex | 3b84d32f09 |
255631503113 has 16 divisors (see below), whose sum is σ = 292477841280. Its totient is φ = 218867193600.
The previous prime is 255631503109. The next prime is 255631503121. The reversal of 255631503113 is 311305136552.
255631503113 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 255631503113 - 22 = 255631503109 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (255631503143) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 49261523 + ... + 49266711.
It is an arithmetic number, because the mean of its divisors is an integer number (18279865080).
Almost surely, 2255631503113 is an apocalyptic number.
It is an amenable number.
255631503113 is a deficient number, since it is larger than the sum of its proper divisors (36846338167).
255631503113 is a wasteful number, since it uses less digits than its factorization.
255631503113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11728.
The product of its (nonzero) digits is 40500, while the sum is 35.
Adding to 255631503113 its reverse (311305136552), we get a palindrome (566936639665).
The spelling of 255631503113 in words is "two hundred fifty-five billion, six hundred thirty-one million, five hundred three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •