Base | Representation |
---|---|
bin | 100001100110000… |
… | …111011100111001 |
3 | 1110021120212220001 |
4 | 201212013130321 |
5 | 2123242440441 |
6 | 131532433001 |
7 | 16652601442 |
oct | 4146073471 |
9 | 1407525801 |
10 | 563640121 |
11 | 26a184190 |
12 | 138918761 |
13 | 8ca07b85 |
14 | 54c002c9 |
15 | 34739731 |
hex | 21987739 |
563640121 has 8 divisors (see below), whose sum is σ = 627963264. Its totient is φ = 501497520.
The previous prime is 563640089. The next prime is 563640137. The reversal of 563640121 is 121046365.
563640121 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 563640121 - 25 = 563640089 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 563640121.
It is not an unprimeable number, because it can be changed into a prime (563640191) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 544590 + ... + 545623.
It is an arithmetic number, because the mean of its divisors is an integer number (78495408).
Almost surely, 2563640121 is an apocalyptic number.
It is an amenable number.
563640121 is a deficient number, since it is larger than the sum of its proper divisors (64323143).
563640121 is a wasteful number, since it uses less digits than its factorization.
563640121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1090271.
The product of its (nonzero) digits is 4320, while the sum is 28.
The square root of 563640121 is about 23741.1061452494. The cubic root of 563640121 is about 826.0391538523.
Adding to 563640121 its reverse (121046365), we get a palindrome (684686486).
The spelling of 563640121 in words is "five hundred sixty-three million, six hundred forty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •