Base | Representation |
---|---|
bin | 1110110101111101111… |
… | …1011101111100100110 |
3 | 220101012202012002011110 |
4 | 3231133133131330212 |
5 | 13134222304430420 |
6 | 313051525245450 |
7 | 24265160024466 |
oct | 3553737357446 |
9 | 811182162143 |
10 | 255005155110 |
11 | 99168842382 |
12 | 41508863886 |
13 | 1b07c004034 |
14 | c4b1455ba6 |
15 | 697743cee0 |
hex | 3b5f7ddf26 |
255005155110 has 16 divisors (see below), whose sum is σ = 612012372336. Its totient is φ = 68001374688.
The previous prime is 255005155081. The next prime is 255005155117. The reversal of 255005155110 is 11551500552.
It is a super-2 number, since 2×2550051551102 (a number of 24 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30), and also a Moran number because the ratio is a prime number: 8500171837 = 255005155110 / (2 + 5 + 5 + 0 + 0 + 5 + 1 + 5 + 5 + 1 + 1 + 0).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (255005155117) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4250085889 + ... + 4250085948.
It is an arithmetic number, because the mean of its divisors is an integer number (38250773271).
Almost surely, 2255005155110 is an apocalyptic number.
255005155110 is an abundant number, since it is smaller than the sum of its proper divisors (357007217226).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
255005155110 is a wasteful number, since it uses less digits than its factorization.
255005155110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8500171847.
The product of its (nonzero) digits is 6250, while the sum is 30.
Adding to 255005155110 its reverse (11551500552), we get a palindrome (266556655662).
The spelling of 255005155110 in words is "two hundred fifty-five billion, five million, one hundred fifty-five thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.107 sec. • engine limits •