Base | Representation |
---|---|
bin | 1001100000000111… |
… | …1010001011000101 |
3 | 20120202110210112102 |
4 | 2120001322023011 |
5 | 20210430343003 |
6 | 1101033001445 |
7 | 120131026133 |
oct | 23001721305 |
9 | 6522423472 |
10 | 2550637253 |
11 | 109984a57a |
12 | 5b2253285 |
13 | 31857b918 |
14 | 1a2a72753 |
15 | eddce588 |
hex | 9807a2c5 |
2550637253 has 4 divisors (see below), whose sum is σ = 2561584428. Its totient is φ = 2539690080.
The previous prime is 2550637249. The next prime is 2550637267. The reversal of 2550637253 is 3527360552.
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 144048004 + 2406589249 = 12002^2 + 49057^2 .
It is a cyclic number.
It is not a de Polignac number, because 2550637253 - 22 = 2550637249 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2550637553) 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, 5473238 + ... + 5473703.
It is an arithmetic number, because the mean of its divisors is an integer number (640396107).
Almost surely, 22550637253 is an apocalyptic number.
It is an amenable number.
2550637253 is a deficient number, since it is larger than the sum of its proper divisors (10947175).
2550637253 is a wasteful number, since it uses less digits than its factorization.
2550637253 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10947174.
The product of its (nonzero) digits is 189000, while the sum is 38.
The square root of 2550637253 is about 50503.8340425754. The cubic root of 2550637253 is about 1366.3110042246.
The spelling of 2550637253 in words is "two billion, five hundred fifty million, six hundred thirty-seven thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •