Base | Representation |
---|---|
bin | 1001010100101001… |
… | …10010101010111001 |
3 | 110220210220102122222 |
4 | 10222110302222321 |
5 | 40222243421133 |
6 | 2144351453425 |
7 | 235013212655 |
oct | 45224625271 |
9 | 13823812588 |
10 | 5005060793 |
11 | 2139254287 |
12 | b78227275 |
13 | 619c11245 |
14 | 356a1ba65 |
15 | 1e4605e98 |
hex | 12a532ab9 |
5005060793 has 4 divisors (see below), whose sum is σ = 5005221108. Its totient is φ = 5004900480.
The previous prime is 5005060759. The next prime is 5005060799. The reversal of 5005060793 is 3970605005.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 3970605005 = 5 ⋅794121001.
It can be written as a sum of positive squares in 2 ways, for example, as 669101689 + 4335959104 = 25867^2 + 65848^2 .
It is a cyclic number.
It is not a de Polignac number, because 5005060793 - 210 = 5005059769 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5005060799) 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, 16448 + ... + 101393.
It is an arithmetic number, because the mean of its divisors is an integer number (1251305277).
Almost surely, 25005060793 is an apocalyptic number.
It is an amenable number.
5005060793 is a deficient number, since it is larger than the sum of its proper divisors (160315).
5005060793 is a wasteful number, since it uses less digits than its factorization.
5005060793 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 160314.
The product of its (nonzero) digits is 28350, while the sum is 35.
The square root of 5005060793 is about 70746.4542786421. The cubic root of 5005060793 is about 1710.5526744272.
Adding to 5005060793 its reverse (3970605005), we get a palindrome (8975665798).
The spelling of 5005060793 in words is "five billion, five million, sixty thousand, seven hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •