Base | Representation |
---|---|
bin | 100001011100000… |
… | …110011100000100 |
3 | 1110002122111021000 |
4 | 201130012130010 |
5 | 2122104431112 |
6 | 131400253300 |
7 | 16621354611 |
oct | 4134063404 |
9 | 1402574230 |
10 | 561014532 |
11 | 268750581 |
12 | 137a71230 |
13 | 8c2c8a80 |
14 | 54719508 |
15 | 343bb7dc |
hex | 21706704 |
561014532 has 48 divisors (see below), whose sum is σ = 1566369280. Its totient is φ = 172619424.
The previous prime is 561014497. The next prime is 561014549. The reversal of 561014532 is 235410165.
561014532 is a `hidden beast` number, since 5 + 610 + 1 + 45 + 3 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 561014496 and 561014505.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 198388 + ... + 201195.
Almost surely, 2561014532 is an apocalyptic number.
561014532 is a gapful number since it is divisible by the number (52) formed by its first and last digit.
It is an amenable number.
561014532 is an abundant number, since it is smaller than the sum of its proper divisors (1005354748).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
561014532 is a wasteful number, since it uses less digits than its factorization.
561014532 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 399609 (or 399601 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 27.
The square root of 561014532 is about 23685.7453334279. The cubic root of 561014532 is about 824.7545186991.
Adding to 561014532 its reverse (235410165), we get a palindrome (796424697).
The spelling of 561014532 in words is "five hundred sixty-one million, fourteen thousand, five hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •