Base | Representation |
---|---|
bin | 1001010101010000… |
… | …0001010000010011 |
3 | 20110120200212222021 |
4 | 2111110001100103 |
5 | 20112243200303 |
6 | 1052323552311 |
7 | 116035413052 |
oct | 22524012023 |
9 | 6416625867 |
10 | 2505053203 |
11 | 1076045604 |
12 | 59ab2b697 |
13 | 30bcab503 |
14 | 19a9a8399 |
15 | e9dc7ebd |
hex | 95501413 |
2505053203 has 4 divisors (see below), whose sum is σ = 2505581728. Its totient is φ = 2504524680.
The previous prime is 2505053197. The next prime is 2505053209. The reversal of 2505053203 is 3023505052.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (2505053197) and next prime (2505053209).
It is a cyclic number.
It is not a de Polignac number, because 2505053203 - 229 = 1968182291 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2505053209) 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, 257088 + ... + 266653.
It is an arithmetic number, because the mean of its divisors is an integer number (626395432).
Almost surely, 22505053203 is an apocalyptic number.
2505053203 is a deficient number, since it is larger than the sum of its proper divisors (528525).
2505053203 is an equidigital number, since it uses as much as digits as its factorization.
2505053203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 528524.
The product of its (nonzero) digits is 4500, while the sum is 25.
The square root of 2505053203 is about 50050.5065209135. The cubic root of 2505053203 is about 1358.1226264288.
Adding to 2505053203 its reverse (3023505052), we get a palindrome (5528558255).
The spelling of 2505053203 in words is "two billion, five hundred five million, fifty-three thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •