Base | Representation |
---|---|
bin | 10000010100111101000… |
… | …00010001110001010001 |
3 | 1222122001101220022112101 |
4 | 20022132200101301101 |
5 | 33142414240310001 |
6 | 1105415552200401 |
7 | 55350140622352 |
oct | 10123640216121 |
9 | 1878041808471 |
10 | 561005010001 |
11 | 1a6a14780437 |
12 | 90887539101 |
13 | 40b96b7a627 |
14 | 1d21d369d29 |
15 | e8d6706a01 |
hex | 829e811c51 |
561005010001 has 4 divisors (see below), whose sum is σ = 568690010212. Its totient is φ = 553320009792.
The previous prime is 561005009953. The next prime is 561005010043. The reversal of 561005010001 is 100010500165.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 404272158976 + 156732851025 = 635824^2 + 395895^2 .
It is a cyclic number.
It is not a de Polignac number, because 561005010001 - 215 = 561004977233 is a prime.
It is a super-2 number, since 2×5610050100012 (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 (561005014001) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3842499996 + ... + 3842500141.
It is an arithmetic number, because the mean of its divisors is an integer number (142172502553).
Almost surely, 2561005010001 is an apocalyptic number.
It is an amenable number.
561005010001 is a deficient number, since it is larger than the sum of its proper divisors (7685000211).
561005010001 is an equidigital number, since it uses as much as digits as its factorization.
561005010001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7685000210.
The product of its (nonzero) digits is 150, while the sum is 19.
Adding to 561005010001 its reverse (100010500165), we get a palindrome (661015510166).
The spelling of 561005010001 in words is "five hundred sixty-one billion, five million, ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •