Base | Representation |
---|---|
bin | 1001011011010110… |
… | …01111010110000001 |
3 | 111001201200111212211 |
4 | 10231223033112001 |
5 | 40331141331212 |
6 | 2154120422121 |
7 | 236265100534 |
oct | 45553172601 |
9 | 14051614784 |
10 | 5061277057 |
11 | 2167a60401 |
12 | b93017941 |
13 | 628764bc5 |
14 | 360292a1b |
15 | 1e950c9a7 |
hex | 12dacf581 |
5061277057 has 4 divisors (see below), whose sum is σ = 5327660080. Its totient is φ = 4794894036.
The previous prime is 5061276973. The next prime is 5061277061. The reversal of 5061277057 is 7507721605.
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: 7507721605 = 5 ⋅1501544321.
It is not a de Polignac number, because 5061277057 - 27 = 5061276929 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5061277157) 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, 133191483 + ... + 133191520.
It is an arithmetic number, because the mean of its divisors is an integer number (1331915020).
Almost surely, 25061277057 is an apocalyptic number.
It is an amenable number.
5061277057 is a deficient number, since it is larger than the sum of its proper divisors (266383023).
5061277057 is a wasteful number, since it uses less digits than its factorization.
5061277057 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 266383022.
The product of its (nonzero) digits is 102900, while the sum is 40.
The square root of 5061277057 is about 71142.6528673200. The cubic root of 5061277057 is about 1716.9330889647.
The spelling of 5061277057 in words is "five billion, sixty-one million, two hundred seventy-seven thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •