Base | Representation |
---|---|
bin | 1001101100101011… |
… | …10000110101011111 |
3 | 111102212012211010011 |
4 | 10312111300311133 |
5 | 41130400021030 |
6 | 2220352224051 |
7 | 243011504221 |
oct | 46625606537 |
9 | 14385184104 |
10 | 5206642015 |
11 | 2232017233 |
12 | 101383b027 |
13 | 64c900183 |
14 | 3756d2411 |
15 | 207173b2a |
hex | 136570d5f |
5206642015 has 4 divisors (see below), whose sum is σ = 6247970424. Its totient is φ = 4165313608.
The previous prime is 5206642013. The next prime is 5206642027. The reversal of 5206642015 is 5102466025.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 5206642015 - 21 = 5206642013 is a prime.
It is a Smith number, since the sum of its digits (31) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5206642013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 520664197 + ... + 520664206.
It is an arithmetic number, because the mean of its divisors is an integer number (1561992606).
Almost surely, 25206642015 is an apocalyptic number.
5206642015 is a deficient number, since it is larger than the sum of its proper divisors (1041328409).
5206642015 is a wasteful number, since it uses less digits than its factorization.
5206642015 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1041328408.
The product of its (nonzero) digits is 14400, while the sum is 31.
The square root of 5206642015 is about 72157.0649001191. The cubic root of 5206642015 is about 1733.2155344213.
The spelling of 5206642015 in words is "five billion, two hundred six million, six hundred forty-two thousand, fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •