Base | Representation |
---|---|
bin | 100001011101100… |
… | …101010001111010 |
3 | 1110010101020010210 |
4 | 201131211101322 |
5 | 2122204344002 |
6 | 131412451550 |
7 | 16624563306 |
oct | 4135452172 |
9 | 1403336123 |
10 | 561403002 |
11 | 268996426 |
12 | 138019bb6 |
13 | 8c403834 |
14 | 547bad06 |
15 | 3444696c |
hex | 2176547a |
561403002 has 16 divisors (see below), whose sum is σ = 1188853632. Its totient is φ = 176126400.
The previous prime is 561403001. The next prime is 561403027. The reversal of 561403002 is 200304165.
It is a happy number.
561403002 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×5614030022 = 630346661309224008, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 561403002.
It is not an unprimeable number, because it can be changed into a prime (561403001) 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, 2751874 + ... + 2752077.
It is an arithmetic number, because the mean of its divisors is an integer number (74303352).
Almost surely, 2561403002 is an apocalyptic number.
561403002 is an abundant number, since it is smaller than the sum of its proper divisors (627450630).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
561403002 is a wasteful number, since it uses less digits than its factorization.
561403002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5503973.
The product of its (nonzero) digits is 720, while the sum is 21.
The square root of 561403002 is about 23693.9444162427. The cubic root of 561403002 is about 824.9448396545.
Adding to 561403002 its reverse (200304165), we get a palindrome (761707167).
The spelling of 561403002 in words is "five hundred sixty-one million, four hundred three thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •