Base | Representation |
---|---|
bin | 1001100011001001… |
… | …01001111111010100 |
3 | 111020021201022111020 |
4 | 10301210221333110 |
5 | 40444411110202 |
6 | 2204414041140 |
7 | 241020614523 |
oct | 46144517724 |
9 | 14207638436 |
10 | 5126660052 |
11 | 21a0958638 |
12 | bb0aa91b0 |
13 | 639178077 |
14 | 368c324ba |
15 | 2001255bc |
hex | 131929fd4 |
5126660052 has 24 divisors (see below), whose sum is σ = 12007697856. Its totient is φ = 1702387968.
The previous prime is 5126659981. The next prime is 5126660059. The reversal of 5126660052 is 2500666215.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 5126659995 and 5126660022.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5126660059) 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 7 ways as a sum of consecutive naturals, for example, 809053 + ... + 815364.
It is an arithmetic number, because the mean of its divisors is an integer number (500320744).
Almost surely, 25126660052 is an apocalyptic number.
It is an amenable number.
5126660052 is an abundant number, since it is smaller than the sum of its proper divisors (6881037804).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5126660052 is a wasteful number, since it uses less digits than its factorization.
5126660052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1624687 (or 1624685 counting only the distinct ones).
The product of its (nonzero) digits is 21600, while the sum is 33.
The square root of 5126660052 is about 71600.6986837419. The cubic root of 5126660052 is about 1724.2947535894.
The spelling of 5126660052 in words is "five billion, one hundred twenty-six million, six hundred sixty thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •