Base | Representation |
---|---|
bin | 1001011001000011… |
… | …01111100010001101 |
3 | 111000101102122210111 |
4 | 10230201233202031 |
5 | 40311223312003 |
6 | 2152151440021 |
7 | 235642244230 |
oct | 45441574215 |
9 | 14011378714 |
10 | 5042010253 |
11 | 21580a0a25 |
12 | b88686011 |
13 | 62477a427 |
14 | 35b8b9417 |
15 | 1e79a3e6d |
hex | 12c86f88d |
5042010253 has 4 divisors (see below), whose sum is σ = 5762297440. Its totient is φ = 4321723068.
The previous prime is 5042010247. The next prime is 5042010277. The reversal of 5042010253 is 3520102405.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 3520102405 = 5 ⋅704020481.
It is a cyclic number.
It is not a de Polignac number, because 5042010253 - 221 = 5039913101 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 (5042010293) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 360143583 + ... + 360143596.
It is an arithmetic number, because the mean of its divisors is an integer number (1440574360).
Almost surely, 25042010253 is an apocalyptic number.
It is an amenable number.
5042010253 is a deficient number, since it is larger than the sum of its proper divisors (720287187).
5042010253 is an equidigital number, since it uses as much as digits as its factorization.
5042010253 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 720287186.
The product of its (nonzero) digits is 1200, while the sum is 22.
The square root of 5042010253 is about 71007.1141013349. The cubic root of 5042010253 is about 1714.7516976549.
Adding to 5042010253 its reverse (3520102405), we get a palindrome (8562112658).
The spelling of 5042010253 in words is "five billion, forty-two million, ten thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •