Base | Representation |
---|---|
bin | 1001101101100001… |
… | …11011100100100101 |
3 | 111110100121122110211 |
4 | 10312300323210211 |
5 | 41134210421002 |
6 | 2221205015421 |
7 | 243126155530 |
oct | 46660734445 |
9 | 14410548424 |
10 | 5213763877 |
11 | 2236040a73 |
12 | 10160b4571 |
13 | 6512249aa |
14 | 376627a17 |
15 | 207acddd7 |
hex | 136c3b925 |
5213763877 has 16 divisors (see below), whose sum is σ = 5994698112. Its totient is φ = 4441927680.
The previous prime is 5213763829. The next prime is 5213763887. The reversal of 5213763877 is 7783673125.
It is a cyclic number.
It is not a de Polignac number, because 5213763877 - 27 = 5213763749 is a prime.
It is a super-2 number, since 2×52137638772 = 54366667530220142258, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 5213763877.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5213763887) 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 15 ways as a sum of consecutive naturals, for example, 1042978 + ... + 1047964.
It is an arithmetic number, because the mean of its divisors is an integer number (374668632).
Almost surely, 25213763877 is an apocalyptic number.
It is an amenable number.
5213763877 is a deficient number, since it is larger than the sum of its proper divisors (780934235).
5213763877 is a wasteful number, since it uses less digits than its factorization.
5213763877 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5868.
The product of its digits is 1481760, while the sum is 49.
The square root of 5213763877 is about 72206.3977567085. The cubic root of 5213763877 is about 1734.0054292008.
The spelling of 5213763877 in words is "five billion, two hundred thirteen million, seven hundred sixty-three thousand, eight hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •