Base | Representation |
---|---|
bin | 11110011110000… |
… | …10010111111101 |
3 | 122210221211110022 |
4 | 33033002113331 |
5 | 1010413201000 |
6 | 41210221525 |
7 | 6222364604 |
oct | 1717022775 |
9 | 583854408 |
10 | 255600125 |
11 | 121309180 |
12 | 717248a5 |
13 | 40c536a1 |
14 | 25d36a3b |
15 | 1768d585 |
hex | f3c25fd |
255600125 has 32 divisors (see below), whose sum is σ = 350034048. Its totient is φ = 184800000.
The previous prime is 255600119. The next prime is 255600131. The reversal of 255600125 is 521006552.
It is an interprime number because it is at equal distance from previous prime (255600119) and next prime (255600131).
It is a de Polignac number, because none of the positive numbers 2k-255600125 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 255600094 and 255600103.
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, 289685 + ... + 290565.
It is an arithmetic number, because the mean of its divisors is an integer number (10938564).
Almost surely, 2255600125 is an apocalyptic number.
255600125 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
255600125 is a deficient number, since it is larger than the sum of its proper divisors (94433923).
255600125 is a wasteful number, since it uses less digits than its factorization.
255600125 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1118 (or 1108 counting only the distinct ones).
The product of its (nonzero) digits is 3000, while the sum is 26.
The square root of 255600125 is about 15987.4990226739. The cubic root of 255600125 is about 634.6296432953.
Adding to 255600125 its reverse (521006552), we get a palindrome (776606677).
The spelling of 255600125 in words is "two hundred fifty-five million, six hundred thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •