Base | Representation |
---|---|
bin | 1001100000100100… |
… | …1010010000011111 |
3 | 20120220001101001202 |
4 | 2120021022100133 |
5 | 20211422210033 |
6 | 1101141430115 |
7 | 120153134111 |
oct | 23011122037 |
9 | 6526041052 |
10 | 2552538143 |
11 | 109a928761 |
12 | 5b2a0b33b |
13 | 318a95bcc |
14 | 1a30093b1 |
15 | ee1578e8 |
hex | 9824a41f |
2552538143 has 4 divisors (see below), whose sum is σ = 2552641200. Its totient is φ = 2552435088.
The previous prime is 2552538139. The next prime is 2552538161. The reversal of 2552538143 is 3418352552.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 2552538143 - 22 = 2552538139 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2552538097 and 2552538106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2552538113) 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, 10571 + ... + 72227.
It is an arithmetic number, because the mean of its divisors is an integer number (638160300).
Almost surely, 22552538143 is an apocalyptic number.
2552538143 is a deficient number, since it is larger than the sum of its proper divisors (103057).
2552538143 is an equidigital number, since it uses as much as digits as its factorization.
2552538143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 103056.
The product of its digits is 144000, while the sum is 38.
The square root of 2552538143 is about 50522.6498018463. The cubic root of 2552538143 is about 1366.6503392920.
The spelling of 2552538143 in words is "two billion, five hundred fifty-two million, five hundred thirty-eight thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •