Base | Representation |
---|---|
bin | 100001011101001… |
… | …111100100011001 |
3 | 1110010012201011010 |
4 | 201131033210121 |
5 | 2122144022243 |
6 | 131410524133 |
7 | 16624043115 |
oct | 4135174431 |
9 | 1403181133 |
10 | 561314073 |
11 | 268935631 |
12 | 137b96649 |
13 | 8c3a2208 |
14 | 54796745 |
15 | 3442a433 |
hex | 2174f919 |
561314073 has 8 divisors (see below), whose sum is σ = 748555200. Its totient is φ = 374141168.
The previous prime is 561314051. The next prime is 561314081. The reversal of 561314073 is 370413165.
561314073 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 a cyclic number.
It is not a de Polignac number, because 561314073 - 214 = 561297689 is a prime.
It is a super-3 number, since 3×5613140733 (a number of 27 digits) contains 333 as substring.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 561314073.
It is not an unprimeable number, because it can be changed into a prime (561314003) 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, 6988 + ... + 34226.
It is an arithmetic number, because the mean of its divisors is an integer number (93569400).
Almost surely, 2561314073 is an apocalyptic number.
It is an amenable number.
561314073 is a deficient number, since it is larger than the sum of its proper divisors (187241127).
561314073 is a wasteful number, since it uses less digits than its factorization.
561314073 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34111.
The product of its (nonzero) digits is 7560, while the sum is 30.
The square root of 561314073 is about 23692.0677231853. The cubic root of 561314073 is about 824.9012789128.
The spelling of 561314073 in words is "five hundred sixty-one million, three hundred fourteen thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •