Base | Representation |
---|---|
bin | 1001011011111100… |
… | …10010100101010001 |
3 | 111002002002020100210 |
4 | 10231332102211101 |
5 | 40333431133212 |
6 | 2154415434333 |
7 | 236355410361 |
oct | 45576224521 |
9 | 14062066323 |
10 | 5066271057 |
11 | 216a861481 |
12 | b948259a9 |
13 | 6297c3033 |
14 | 360bd29a1 |
15 | 1e9b9753c |
hex | 12df92951 |
5066271057 has 4 divisors (see below), whose sum is σ = 6755028080. Its totient is φ = 3377514036.
The previous prime is 5066271043. The next prime is 5066271071. The reversal of 5066271057 is 7501726605.
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 an interprime number because it is at equal distance from previous prime (5066271043) and next prime (5066271071).
It is not a de Polignac number, because 5066271057 - 28 = 5066270801 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5066271257) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 844378507 + ... + 844378512.
It is an arithmetic number, because the mean of its divisors is an integer number (1688757020).
Almost surely, 25066271057 is an apocalyptic number.
It is an amenable number.
5066271057 is a deficient number, since it is larger than the sum of its proper divisors (1688757023).
5066271057 is a wasteful number, since it uses less digits than its factorization.
5066271057 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1688757022.
The product of its (nonzero) digits is 88200, while the sum is 39.
The square root of 5066271057 is about 71177.7427079561. The cubic root of 5066271057 is about 1717.4976069158.
The spelling of 5066271057 in words is "five billion, sixty-six million, two hundred seventy-one thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •