Base | Representation |
---|---|
bin | 1110110111110011111… |
… | …1001001101100000101 |
3 | 220102111020022210202011 |
4 | 3231330333021230011 |
5 | 13141231000000010 |
6 | 313213003414221 |
7 | 24313346111125 |
oct | 3557477115405 |
9 | 812436283664 |
10 | 255500000005 |
11 | 993a20a86a8 |
12 | 41626524371 |
13 | 1b12a6a2873 |
14 | c51b068c85 |
15 | 69a5ad8a8a |
hex | 3b7cfc9b05 |
255500000005 has 16 divisors (see below), whose sum is σ = 325758630960. Its totient is φ = 192376452096.
The previous prime is 255499999901. The next prime is 255500000009. The reversal of 255500000005 is 500000005552.
It can be written as a sum of positive squares in 8 ways, for example, as 3735898884 + 251764101121 = 61122^2 + 501761^2 .
It is not a de Polignac number, because 255500000005 - 27 = 255499999877 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (255500000009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5175924 + ... + 5225053.
It is an arithmetic number, because the mean of its divisors is an integer number (20359914435).
Almost surely, 2255500000005 is an apocalyptic number.
It is an amenable number.
255500000005 is a deficient number, since it is larger than the sum of its proper divisors (70258630955).
255500000005 is an equidigital number, since it uses as much as digits as its factorization.
255500000005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10401033 (or 10400999 counting only the distinct ones).
The product of its (nonzero) digits is 1250, while the sum is 22.
Adding to 255500000005 its reverse (500000005552), we get a palindrome (755500005557).
The spelling of 255500000005 in words is "two hundred fifty-five billion, five hundred million, five", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •