Base | Representation |
---|---|
bin | 1011100011100011101011… |
… | …01110001010111111100101 |
3 | 10022222021020101112012200020 |
4 | 11301301311232022333211 |
5 | 11312313212344423221 |
6 | 130013353012305353 |
7 | 5231612210302104 |
oct | 561616556127745 |
9 | 108867211465606 |
10 | 25411001561061 |
11 | 8107821a10616 |
12 | 2a249a5012259 |
13 | 112432a03937c |
14 | 63bc82d6203b |
15 | 2e0ee9c4cac6 |
hex | 171c75b8afe5 |
25411001561061 has 4 divisors (see below), whose sum is σ = 33881335414752. Its totient is φ = 16940667707372.
The previous prime is 25411001561059. The next prime is 25411001561083. The reversal of 25411001561061 is 16016510011452.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 25411001561061 - 21 = 25411001561059 is a prime.
It is a super-2 number, since 2×254110015610612 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (25411001561041) 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, 4235166926841 + ... + 4235166926846.
It is an arithmetic number, because the mean of its divisors is an integer number (8470333853688).
Almost surely, 225411001561061 is an apocalyptic number.
It is an amenable number.
25411001561061 is a deficient number, since it is larger than the sum of its proper divisors (8470333853691).
25411001561061 is an equidigital number, since it uses as much as digits as its factorization.
25411001561061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8470333853690.
The product of its (nonzero) digits is 7200, while the sum is 33.
The spelling of 25411001561061 in words is "twenty-five trillion, four hundred eleven billion, one million, five hundred sixty-one thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •