Base | Representation |
---|---|
bin | 1001100000000100… |
… | …1010100010000101 |
3 | 20120202002212212011 |
4 | 2120001022202011 |
5 | 20210403121432 |
6 | 1101024454221 |
7 | 120126254206 |
oct | 23001124205 |
9 | 6522085764 |
10 | 2550442117 |
11 | 1099726a03 |
12 | 5b217a371 |
13 | 318510b62 |
14 | 1a2a215ad |
15 | edd91847 |
hex | 9804a885 |
2550442117 has 8 divisors (see below), whose sum is σ = 2580211800. Its totient is φ = 2520697344.
The previous prime is 2550442109. The next prime is 2550442127. The reversal of 2550442117 is 7112440552.
It can be written as a sum of positive squares in 4 ways, for example, as 929091361 + 1621350756 = 30481^2 + 40266^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 2550442117 - 23 = 2550442109 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 (2550442127) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 270283 + ... + 279559.
It is an arithmetic number, because the mean of its divisors is an integer number (322526475).
Almost surely, 22550442117 is an apocalyptic number.
It is an amenable number.
2550442117 is a deficient number, since it is larger than the sum of its proper divisors (29769683).
2550442117 is an equidigital number, since it uses as much as digits as its factorization.
2550442117 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12455.
The product of its (nonzero) digits is 11200, while the sum is 31.
The square root of 2550442117 is about 50501.9021126927. The cubic root of 2550442117 is about 1366.2761602180.
Adding to 2550442117 its reverse (7112440552), we get a palindrome (9662882669).
The spelling of 2550442117 in words is "two billion, five hundred fifty million, four hundred forty-two thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •