Base | Representation |
---|---|
bin | 1010111011000110… |
… | …10101111000011011 |
3 | 120010201010010112002 |
4 | 11131203111320123 |
5 | 44002303404201 |
6 | 2405532511215 |
7 | 265220352455 |
oct | 53543257033 |
9 | 16121103462 |
10 | 5864513051 |
11 | 253a401501 |
12 | 117801b50b |
13 | 725cab987 |
14 | 3d8c212d5 |
15 | 244cc376b |
hex | 15d8d5e1b |
5864513051 has 4 divisors (see below), whose sum is σ = 5865638112. Its totient is φ = 5863387992.
The previous prime is 5864513047. The next prime is 5864513059. The reversal of 5864513051 is 1503154685.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 1503154685 = 5 ⋅300630937.
It is a cyclic number.
It is not a de Polignac number, because 5864513051 - 22 = 5864513047 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5864512996 and 5864513014.
It is not an unprimeable number, because it can be changed into a prime (5864513059) 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, 554675 + ... + 565148.
It is an arithmetic number, because the mean of its divisors is an integer number (1466409528).
Almost surely, 25864513051 is an apocalyptic number.
5864513051 is a deficient number, since it is larger than the sum of its proper divisors (1125061).
5864513051 is a wasteful number, since it uses less digits than its factorization.
5864513051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1125060.
The product of its (nonzero) digits is 72000, while the sum is 38.
The square root of 5864513051 is about 76580.1087162979. The cubic root of 5864513051 is about 1803.3387672839.
The spelling of 5864513051 in words is "five billion, eight hundred sixty-four million, five hundred thirteen thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •