Base | Representation |
---|---|
bin | 11110011010010… |
… | …01001000101010 |
3 | 122210000121020220 |
4 | 33031021020222 |
5 | 1010301303110 |
6 | 41151430510 |
7 | 6215226033 |
oct | 1715111052 |
9 | 583017226 |
10 | 255103530 |
11 | 120aaa070 |
12 | 71525436 |
13 | 40b0b646 |
14 | 25c47a8a |
15 | 175e1370 |
hex | f34922a |
255103530 has 128 divisors (see below), whose sum is σ = 726900480. Its totient is φ = 56586240.
The previous prime is 255103487. The next prime is 255103543. The reversal of 255103530 is 35301552.
It is a super-2 number, since 2×2551035302 = 130155622036921800, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 255103530.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 206956 + ... + 208184.
It is an arithmetic number, because the mean of its divisors is an integer number (5678910).
Almost surely, 2255103530 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 255103530, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (363450240).
255103530 is an abundant number, since it is smaller than the sum of its proper divisors (471796950).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
255103530 is a wasteful number, since it uses less digits than its factorization.
255103530 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1304.
The product of its (nonzero) digits is 2250, while the sum is 24.
The square root of 255103530 is about 15971.9607437534. The cubic root of 255103530 is about 634.2183782015.
The spelling of 255103530 in words is "two hundred fifty-five million, one hundred three thousand, five hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •