Base | Representation |
---|---|
bin | 10000010100111110001… |
… | …00011010010010100001 |
3 | 1222122002001201112210011 |
4 | 20022133010122102201 |
5 | 33142424201411311 |
6 | 1105420531204521 |
7 | 55350314262634 |
oct | 10123704322241 |
9 | 1878061645704 |
10 | 561014482081 |
11 | 1a6a1a05a9a9 |
12 | 9088a746741 |
13 | 40b98b15b01 |
14 | 1d220713c1b |
15 | e8d7478321 |
hex | 829f11a4a1 |
561014482081 has 9 divisors (see below), whose sum is σ = 563047876569. Its totient is φ = 558988412736.
The previous prime is 561014482037. The next prime is 561014482153. The reversal of 561014482081 is 180284410165.
The square root of 561014482081 is 749009.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 533178896481 + 27835585600 = 730191^2 + 166840^2 .
It is not a de Polignac number, because 561014482081 - 231 = 558866998433 is a prime.
It is a super-2 number, since 2×5610144820812 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (561014482001) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 234438621 + ... + 234441013.
Almost surely, 2561014482081 is an apocalyptic number.
561014482081 is the 749009-th square number.
561014482081 is the 374505-th centered octagonal number.
It is an amenable number.
561014482081 is a deficient number, since it is larger than the sum of its proper divisors (2033394488).
561014482081 is an frugal number, since it uses more digits than its factorization.
561014482081 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5412 (or 2706 counting only the distinct ones).
The product of its (nonzero) digits is 61440, while the sum is 40.
The spelling of 561014482081 in words is "five hundred sixty-one billion, fourteen million, four hundred eighty-two thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •