Base | Representation |
---|---|
bin | 1001100101011001… |
… | …0010000010101001 |
3 | 20122022002111112102 |
4 | 2121112102002221 |
5 | 20232111130423 |
6 | 1103143023145 |
7 | 120520025525 |
oct | 23126220251 |
9 | 6568074472 |
10 | 2572755113 |
11 | 1100286aa5 |
12 | 5b973aab5 |
13 | 320024006 |
14 | 1a598cd85 |
15 | 100cecc28 |
hex | 995920a9 |
2572755113 has 4 divisors (see below), whose sum is σ = 2578895760. Its totient is φ = 2566614468.
The previous prime is 2572755109. The next prime is 2572755127. The reversal of 2572755113 is 3115572752.
It is a happy number.
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 2572755113 - 22 = 2572755109 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2572751113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3069695 + ... + 3070532.
It is an arithmetic number, because the mean of its divisors is an integer number (644723940).
Almost surely, 22572755113 is an apocalyptic number.
It is an amenable number.
2572755113 is a deficient number, since it is larger than the sum of its proper divisors (6140647).
2572755113 is an equidigital number, since it uses as much as digits as its factorization.
2572755113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6140646.
The product of its digits is 73500, while the sum is 38.
The square root of 2572755113 is about 50722.3334735302. Note that the first 3 decimals coincide. The cubic root of 2572755113 is about 1370.2489669540.
The spelling of 2572755113 in words is "two billion, five hundred seventy-two million, seven hundred fifty-five thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •