Base | Representation |
---|---|
bin | 1001011100011111… |
… | …10011111011100101 |
3 | 111002101201120211112 |
4 | 10232033303323211 |
5 | 40341120122401 |
6 | 2155102114405 |
7 | 236442430232 |
oct | 45617637345 |
9 | 14071646745 |
10 | 5070864101 |
11 | 2172409286 |
12 | b9627ba05 |
13 | 62a740804 |
14 | 36166a789 |
15 | 1ea2a33bb |
hex | 12e3f3ee5 |
5070864101 has 4 divisors (see below), whose sum is σ = 5117385900. Its totient is φ = 5024342304.
The previous prime is 5070864079. The next prime is 5070864103. The reversal of 5070864101 is 1014680705.
It is a happy number.
It is a Cunningham number, because it is equal to 712102+1.
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 3534302500 + 1536561601 = 59450^2 + 39199^2 .
It is a cyclic number.
It is not a de Polignac number, because 5070864101 - 26 = 5070864037 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5070864103) 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, 23260736 + ... + 23260953.
It is an arithmetic number, because the mean of its divisors is an integer number (1279346475).
Almost surely, 25070864101 is an apocalyptic number.
It is an amenable number.
5070864101 is a deficient number, since it is larger than the sum of its proper divisors (46521799).
5070864101 is a wasteful number, since it uses less digits than its factorization.
5070864101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46521798.
The product of its (nonzero) digits is 6720, while the sum is 32.
The square root of 5070864101 is about 71210.0000070215. Note that the first 5 decimals coincide. The cubic root of 5070864101 is about 1718.0164737044.
The spelling of 5070864101 in words is "five billion, seventy million, eight hundred sixty-four thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •