Base | Representation |
---|---|
bin | 100101010001001101100… |
… | …011011111111111001011 |
3 | 100001211122120121111112000 |
4 | 211101031203133333023 |
5 | 313430114011110412 |
6 | 5240315344522043 |
7 | 353014325631234 |
oct | 45211543377713 |
9 | 10054576544460 |
10 | 2561101660107 |
11 | 8a8180134941 |
12 | 354437920323 |
13 | 1576844517c3 |
14 | 8bd5a9b808b |
15 | 46947e264dc |
hex | 2544d8dffcb |
2561101660107 has 8 divisors (see below), whose sum is σ = 3794224681680. Its totient is φ = 1707401106720.
The previous prime is 2561101660099. The next prime is 2561101660111. The reversal of 2561101660107 is 7010661011652.
It is a happy number.
2561101660107 is a `hidden beast` number, since 2 + 561 + 10 + 16 + 60 + 10 + 7 = 666.
It is not a de Polignac number, because 2561101660107 - 23 = 2561101660099 is a prime.
It is not an unprimeable number, because it can be changed into a prime (2561101660157) 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, 47427808494 + ... + 47427808547.
It is an arithmetic number, because the mean of its divisors is an integer number (474278085210).
Almost surely, 22561101660107 is an apocalyptic number.
2561101660107 is a gapful number since it is divisible by the number (27) formed by its first and last digit.
2561101660107 is a deficient number, since it is larger than the sum of its proper divisors (1233123021573).
2561101660107 is an equidigital number, since it uses as much as digits as its factorization.
2561101660107 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 94855617050 (or 94855617044 counting only the distinct ones).
The product of its (nonzero) digits is 15120, while the sum is 36.
Adding to 2561101660107 its reverse (7010661011652), we get a palindrome (9571762671759).
The spelling of 2561101660107 in words is "two trillion, five hundred sixty-one billion, one hundred one million, six hundred sixty thousand, one hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •