Base | Representation |
---|---|
bin | 1001011101100110… |
… | …0101111101110010 |
3 | 20120000120212020100 |
4 | 2113121211331302 |
5 | 20200224144342 |
6 | 1100014253230 |
7 | 116642141112 |
oct | 22731457562 |
9 | 6500525210 |
10 | 2540068722 |
11 | 1093891254 |
12 | 5aa7b7216 |
13 | 31631b359 |
14 | 1a14c1042 |
15 | ecee2e4c |
hex | 97665f72 |
2540068722 has 48 divisors (see below), whose sum is σ = 5715866520. Its totient is φ = 814530816.
The previous prime is 2540068717. The next prime is 2540068757. The reversal of 2540068722 is 2278600452.
It can be written as a sum of positive squares in 4 ways, for example, as 2533209561 + 6859161 = 50331^2 + 2619^2 .
It is a super-2 number, since 2×25400687222 = 12903898224965426568, which contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 37848 + ... + 80700.
Almost surely, 22540068722 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2540068722, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2857933260).
2540068722 is an abundant number, since it is smaller than the sum of its proper divisors (3175797798).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2540068722 is a wasteful number, since it uses less digits than its factorization.
2540068722 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42987 (or 42984 counting only the distinct ones).
The product of its (nonzero) digits is 53760, while the sum is 36.
The square root of 2540068722 is about 50399.0944561507. The cubic root of 2540068722 is about 1364.4212947585.
The spelling of 2540068722 in words is "two billion, five hundred forty million, sixty-eight thousand, seven hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •