Base | Representation |
---|---|
bin | 1001010111101010… |
… | …00001001011111101 |
3 | 110222120101000020202 |
4 | 10223311001023331 |
5 | 40300223123302 |
6 | 2151052253245 |
7 | 235440504035 |
oct | 45365011375 |
9 | 13876330222 |
10 | 5030286077 |
11 | 2151513423 |
12 | b84771225 |
13 | 622203b4b |
14 | 35a1068c5 |
15 | 1e693a202 |
hex | 12bd412fd |
5030286077 has 4 divisors (see below), whose sum is σ = 5326185276. Its totient is φ = 4734386880.
The previous prime is 5030286073. The next prime is 5030286181. The reversal of 5030286077 is 7706820305.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 4021969561 + 1008316516 = 63419^2 + 31754^2 .
It is a cyclic number.
It is not a de Polignac number, because 5030286077 - 22 = 5030286073 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 5030286077.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5030286073) 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, 147949574 + ... + 147949607.
It is an arithmetic number, because the mean of its divisors is an integer number (1331546319).
Almost surely, 25030286077 is an apocalyptic number.
It is an amenable number.
5030286077 is a deficient number, since it is larger than the sum of its proper divisors (295899199).
5030286077 is a wasteful number, since it uses less digits than its factorization.
5030286077 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 295899198.
The product of its (nonzero) digits is 70560, while the sum is 38.
The square root of 5030286077 is about 70924.5097057428. The cubic root of 5030286077 is about 1713.4215632781.
The spelling of 5030286077 in words is "five billion, thirty million, two hundred eighty-six thousand, seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •