Base | Representation |
---|---|
bin | 11110011001101… |
… | …01101001101101 |
3 | 122202212112210011 |
4 | 33030311221231 |
5 | 1010241224400 |
6 | 41150013221 |
7 | 6214444255 |
oct | 1714655155 |
9 | 582775704 |
10 | 255023725 |
11 | 120a55110 |
12 | 714a7211 |
13 | 40ab1218 |
14 | 25c26965 |
15 | 175c78ba |
hex | f335a6d |
255023725 has 24 divisors (see below), whose sum is σ = 349165152. Its totient is φ = 183220800.
The previous prime is 255023683. The next prime is 255023729. The reversal of 255023725 is 527320552.
It is not a de Polignac number, because 255023725 - 27 = 255023597 is a prime.
It is a hoax number, since the sum of its digits (31) coincides with the sum of the digits of its distinct prime factors.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (255023729) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 17239 + ... + 28411.
It is an arithmetic number, because the mean of its divisors is an integer number (14548548).
Almost surely, 2255023725 is an apocalyptic number.
255023725 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
255023725 is a deficient number, since it is larger than the sum of its proper divisors (94141427).
255023725 is a wasteful number, since it uses less digits than its factorization.
255023725 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11277 (or 11272 counting only the distinct ones).
The product of its (nonzero) digits is 21000, while the sum is 31.
The square root of 255023725 is about 15969.4622639587. The cubic root of 255023725 is about 634.1522363276.
The spelling of 255023725 in words is "two hundred fifty-five million, twenty-three thousand, seven hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •