Base | Representation |
---|---|
bin | 100001011000110… |
… | …110100101000101 |
3 | 1110001001020101000 |
4 | 201120312211011 |
5 | 2121400210031 |
6 | 131330123513 |
7 | 16611210456 |
oct | 4130664505 |
9 | 1401036330 |
10 | 560163141 |
11 | 26821994a |
12 | 137720599 |
13 | 8c08b3a5 |
14 | 5457712d |
15 | 3429e3e6 |
hex | 21636945 |
560163141 has 32 divisors (see below), whose sum is σ = 881470080. Its totient is φ = 350362368.
The previous prime is 560163139. The next prime is 560163151. The reversal of 560163141 is 141361065.
560163141 is a `hidden beast` number, since 560 + 1 + 63 + 1 + 41 = 666.
It is not a de Polignac number, because 560163141 - 21 = 560163139 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (560163151) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 157515 + ... + 161031.
It is an arithmetic number, because the mean of its divisors is an integer number (27545940).
Almost surely, 2560163141 is an apocalyptic number.
560163141 is a gapful number since it is divisible by the number (51) formed by its first and last digit.
It is an amenable number.
560163141 is a deficient number, since it is larger than the sum of its proper divisors (321306939).
560163141 is a wasteful number, since it uses less digits than its factorization.
560163141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3890 (or 3884 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 27.
The square root of 560163141 is about 23667.7658641453. The cubic root of 560163141 is about 824.3370939290.
The spelling of 560163141 in words is "five hundred sixty million, one hundred sixty-three thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •