Base | Representation |
---|---|
bin | 100011010010100000111… |
… | …010010000010100001001 |
3 | 22120211111200110002212222 |
4 | 203102200322100110021 |
5 | 304213011130240211 |
6 | 5054020245143425 |
7 | 340130163632546 |
oct | 43224072202411 |
9 | 8524450402788 |
10 | 2425061180681 |
11 | 85550a8a7157 |
12 | 331bb00bab75 |
13 | 1478b3caa3b9 |
14 | 855331a3bcd |
15 | 43134b311db |
hex | 234a0e90509 |
2425061180681 has 4 divisors (see below), whose sum is σ = 2425078565700. Its totient is φ = 2425043795664.
The previous prime is 2425061180653. The next prime is 2425061180699. The reversal of 2425061180681 is 1860811605242.
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 2395944877456 + 29116303225 = 1547884^2 + 170635^2 .
It is a cyclic number.
It is not a de Polignac number, because 2425061180681 - 210 = 2425061179657 is a prime.
It is a super-2 number, since 2×24250611806812 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2425061180081) 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, 8481566 + ... + 8762823.
It is an arithmetic number, because the mean of its divisors is an integer number (606269641425).
Almost surely, 22425061180681 is an apocalyptic number.
It is an amenable number.
2425061180681 is a deficient number, since it is larger than the sum of its proper divisors (17385019).
2425061180681 is a wasteful number, since it uses less digits than its factorization.
2425061180681 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17385018.
The product of its (nonzero) digits is 184320, while the sum is 44.
The spelling of 2425061180681 in words is "two trillion, four hundred twenty-five billion, sixty-one million, one hundred eighty thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •