Base | Representation |
---|---|
bin | 11100000011111000… |
… | …11010101001110001 |
3 | 1102212220110022200202 |
4 | 32001330122221301 |
5 | 221323120004221 |
6 | 10530515124545 |
7 | 1042216251302 |
oct | 160174325161 |
9 | 42786408622 |
10 | 15065000561 |
11 | 6430888996 |
12 | 2b052a3755 |
13 | 1561157120 |
14 | a2cb047a9 |
15 | 5d28a3d0b |
hex | 381f1aa71 |
15065000561 has 8 divisors (see below), whose sum is σ = 16340567040. Its totient is φ = 13806108432.
The previous prime is 15065000543. The next prime is 15065000579. The reversal of 15065000561 is 16500056051.
15065000561 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (15065000543) and next prime (15065000579).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 15065000561 - 218 = 15064738417 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (15065000761) 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 7 ways as a sum of consecutive naturals, for example, 4166705 + ... + 4170318.
It is an arithmetic number, because the mean of its divisors is an integer number (2042570880).
Almost surely, 215065000561 is an apocalyptic number.
It is an amenable number.
15065000561 is a deficient number, since it is larger than the sum of its proper divisors (1275566479).
15065000561 is a wasteful number, since it uses less digits than its factorization.
15065000561 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8337175.
The product of its (nonzero) digits is 4500, while the sum is 29.
The spelling of 15065000561 in words is "fifteen billion, sixty-five million, five hundred sixty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •