Base | Representation |
---|---|
bin | 1001110000111101… |
… | …01101010111001001 |
3 | 111112100202200222012 |
4 | 10320132231113021 |
5 | 41214042312023 |
6 | 2224113505305 |
7 | 243625603406 |
oct | 47036552711 |
9 | 14470680865 |
10 | 5242541513 |
11 | 2250307040 |
12 | 1023872235 |
13 | 65718c491 |
14 | 37a3992ad |
15 | 20a3b5978 |
hex | 1387ad5c9 |
5242541513 has 4 divisors (see below), whose sum is σ = 5719136208. Its totient is φ = 4765946820.
The previous prime is 5242541509. The next prime is 5242541519. The reversal of 5242541513 is 3151452425.
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.
It is a cyclic number.
It is not a de Polignac number, because 5242541513 - 22 = 5242541509 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 5242541513.
It is not an unprimeable number, because it can be changed into a prime (5242541519) 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, 238297331 + ... + 238297352.
It is an arithmetic number, because the mean of its divisors is an integer number (1429784052).
Almost surely, 25242541513 is an apocalyptic number.
It is an amenable number.
5242541513 is a deficient number, since it is larger than the sum of its proper divisors (476594695).
5242541513 is a wasteful number, since it uses less digits than its factorization.
5242541513 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 476594694.
The product of its digits is 24000, while the sum is 32.
The square root of 5242541513 is about 72405.3969880699. The cubic root of 5242541513 is about 1737.1898879488.
Adding to 5242541513 its reverse (3151452425), we get a palindrome (8393993938).
The spelling of 5242541513 in words is "five billion, two hundred forty-two million, five hundred forty-one thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •