Base | Representation |
---|---|
bin | 1001100011001010… |
… | …11110110110111111 |
3 | 111020022010022112210 |
4 | 10301211132312333 |
5 | 40444440022412 |
6 | 2204422431503 |
7 | 241022506056 |
oct | 46145366677 |
9 | 14208108483 |
10 | 5126876607 |
11 | 21a0a96306 |
12 | bb0b92593 |
13 | 6392227c8 |
14 | 368c8b39d |
15 | 20016983c |
hex | 13195edbf |
5126876607 has 8 divisors (see below), whose sum is σ = 6981278976. Its totient is φ = 3345195992.
The previous prime is 5126876581. The next prime is 5126876633. The reversal of 5126876607 is 7066786215.
5126876607 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (5126876581) and next prime (5126876633).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5126876607 - 231 = 2979392959 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5126876107) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 18180273 + ... + 18180554.
It is an arithmetic number, because the mean of its divisors is an integer number (872659872).
Almost surely, 25126876607 is an apocalyptic number.
5126876607 is a deficient number, since it is larger than the sum of its proper divisors (1854402369).
5126876607 is a wasteful number, since it uses less digits than its factorization.
5126876607 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36360877.
The product of its (nonzero) digits is 846720, while the sum is 48.
The square root of 5126876607 is about 71602.2109086025. The cubic root of 5126876607 is about 1724.3190318647.
The spelling of 5126876607 in words is "five billion, one hundred twenty-six million, eight hundred seventy-six thousand, six hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •