Base | Representation |
---|---|
bin | 1001100000000100… |
… | …0110000000111101 |
3 | 20120202001221110211 |
4 | 2120001012000331 |
5 | 20210402023423 |
6 | 1101024232421 |
7 | 120126146233 |
oct | 23001060075 |
9 | 6522057424 |
10 | 2550423613 |
11 | 1099714011 |
12 | 5b216b711 |
13 | 3185055ca |
14 | 1a2a18953 |
15 | edd8b10d |
hex | 9804603d |
2550423613 has 4 divisors (see below), whose sum is σ = 2567540700. Its totient is φ = 2533306528.
The previous prime is 2550423607. The next prime is 2550423641. The reversal of 2550423613 is 3163240552.
It is a happy number.
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 1514999929 + 1035423684 = 38923^2 + 32178^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2550423613 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 (2550423643) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8558320 + ... + 8558617.
It is an arithmetic number, because the mean of its divisors is an integer number (641885175).
Almost surely, 22550423613 is an apocalyptic number.
It is an amenable number.
2550423613 is a deficient number, since it is larger than the sum of its proper divisors (17117087).
2550423613 is a wasteful number, since it uses less digits than its factorization.
2550423613 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17117086.
The product of its (nonzero) digits is 21600, while the sum is 31.
The square root of 2550423613 is about 50501.7189113400. The cubic root of 2550423613 is about 1366.2728560020.
The spelling of 2550423613 in words is "two billion, five hundred fifty million, four hundred twenty-three thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •