Base | Representation |
---|---|
bin | 100001011110001… |
… | …100110111000101 |
3 | 1110010200110112100 |
4 | 201132030313011 |
5 | 2122230041000 |
6 | 131420142313 |
7 | 16626140052 |
oct | 4136146705 |
9 | 1403613470 |
10 | 561565125 |
11 | 268a97210 |
12 | 138097999 |
13 | 8c45c574 |
14 | 54820029 |
15 | 34479a00 |
hex | 2178cdc5 |
561565125 has 96 divisors (see below), whose sum is σ = 1152942336. Its totient is φ = 260304000.
The previous prime is 561565111. The next prime is 561565133. The reversal of 561565125 is 521565165.
561565125 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 561565125 - 28 = 561564869 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 561565125.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 283639 + ... + 285611.
It is an arithmetic number, because the mean of its divisors is an integer number (12009816).
Almost surely, 2561565125 is an apocalyptic number.
561565125 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
561565125 is an abundant number, since it is smaller than the sum of its proper divisors (591377211).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
561565125 is a wasteful number, since it uses less digits than its factorization.
561565125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2028 (or 2015 counting only the distinct ones).
The product of its digits is 45000, while the sum is 36.
The square root of 561565125 is about 23697.3653598876. The cubic root of 561565125 is about 825.0242417119.
The spelling of 561565125 in words is "five hundred sixty-one million, five hundred sixty-five thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •