Base | Representation |
---|---|
bin | 1001100001001011… |
… | …1111001100000101 |
3 | 20121001220020210221 |
4 | 2120102333030011 |
5 | 20213102123440 |
6 | 1101312544341 |
7 | 120214053445 |
oct | 23022771405 |
9 | 6531806727 |
10 | 2555114245 |
11 | 10a1328172 |
12 | 5b38520b1 |
13 | 319488628 |
14 | 1a34ba125 |
15 | ee4b5d4a |
hex | 984bf305 |
2555114245 has 8 divisors (see below), whose sum is σ = 3108139416. Its totient is φ = 2016089856.
The previous prime is 2555114227. The next prime is 2555114257. The reversal of 2555114245 is 5424115552.
It can be written as a sum of positive squares in 4 ways, for example, as 80748196 + 2474366049 = 8986^2 + 49743^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2555114245 - 223 = 2546725637 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2555114245.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3499792 + ... + 3500521.
It is an arithmetic number, because the mean of its divisors is an integer number (388517427).
Almost surely, 22555114245 is an apocalyptic number.
It is an amenable number.
2555114245 is a deficient number, since it is larger than the sum of its proper divisors (553025171).
2555114245 is an equidigital number, since it uses as much as digits as its factorization.
2555114245 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7000391.
The product of its digits is 40000, while the sum is 34.
The square root of 2555114245 is about 50548.1378984429. The cubic root of 2555114245 is about 1367.1099402541.
Adding to 2555114245 its reverse (5424115552), we get a palindrome (7979229797).
The spelling of 2555114245 in words is "two billion, five hundred fifty-five million, one hundred fourteen thousand, two hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •