Base | Representation |
---|---|
bin | 1001110100010000… |
… | …00000000000000001 |
3 | 111121021201000001122 |
4 | 10322020000000001 |
5 | 41243124033402 |
6 | 2230541242025 |
7 | 244412322221 |
oct | 47210000001 |
9 | 14537630048 |
10 | 5270142977 |
11 | 2264949470 |
12 | 1030b63315 |
13 | 65cb047c8 |
14 | 37dd02081 |
15 | 20ca18ca2 |
hex | 13a200001 |
5270142977 has 4 divisors (see below), whose sum is σ = 5749246896. Its totient is φ = 4791039060.
The previous prime is 5270142971. The next prime is 5270142979. The reversal of 5270142977 is 7792410725.
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 5270142977 - 220 = 5269094401 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5270142971) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 239551943 + ... + 239551964.
It is an arithmetic number, because the mean of its divisors is an integer number (1437311724).
It is a Proth number, since it is equal to 2513 ⋅ 221 + 1 and 2513 < 221.
Almost surely, 25270142977 is an apocalyptic number.
It is an amenable number.
5270142977 is a deficient number, since it is larger than the sum of its proper divisors (479103919).
5270142977 is a wasteful number, since it uses less digits than its factorization.
5270142977 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 479103918.
The product of its (nonzero) digits is 246960, while the sum is 44.
The square root of 5270142977 is about 72595.7504059294. The cubic root of 5270142977 is about 1740.2332642969.
The spelling of 5270142977 in words is "five billion, two hundred seventy million, one hundred forty-two thousand, nine hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •