Base | Representation |
---|---|
bin | 100000111000111010100… |
… | …101000110000111100101 |
3 | 22000001210201212120021122 |
4 | 200320322211012013211 |
5 | 244012224203204423 |
6 | 4450143021423325 |
7 | 322201160424602 |
oct | 40707245060745 |
9 | 8001721776248 |
10 | 2260135600613 |
11 | 7a1577696870 |
12 | 306042a0ab45 |
13 | 13518c43a477 |
14 | 7b5694416a9 |
15 | 3dbd0a3c8c8 |
hex | 20e3a9461e5 |
2260135600613 has 4 divisors (see below), whose sum is σ = 2465602473408. Its totient is φ = 2054668727820.
The previous prime is 2260135600607. The next prime is 2260135600621. The reversal of 2260135600613 is 3160065310622.
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 2260135600613 - 28 = 2260135600357 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2260135600603) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 102733436381 + ... + 102733436402.
It is an arithmetic number, because the mean of its divisors is an integer number (616400618352).
Almost surely, 22260135600613 is an apocalyptic number.
It is an amenable number.
2260135600613 is a deficient number, since it is larger than the sum of its proper divisors (205466872795).
2260135600613 is a wasteful number, since it uses less digits than its factorization.
2260135600613 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 205466872794.
The product of its (nonzero) digits is 38880, while the sum is 35.
The spelling of 2260135600613 in words is "two trillion, two hundred sixty billion, one hundred thirty-five million, six hundred thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •