Base | Representation |
---|---|
bin | 1001011011010100… |
… | …01110101111010011 |
3 | 111001201012001220000 |
4 | 10231222032233103 |
5 | 40331104344220 |
6 | 2154111021043 |
7 | 236262616203 |
oct | 45552165723 |
9 | 14051161800 |
10 | 5061012435 |
11 | 216789a606 |
12 | b92b0a783 |
13 | 6286a161b |
14 | 360224403 |
15 | 1e94a9390 |
hex | 12da8ebd3 |
5061012435 has 40 divisors (see below), whose sum is σ = 9092348496. Its totient is φ = 2693252160.
The previous prime is 5061012419. The next prime is 5061012457. The reversal of 5061012435 is 5342101605.
5061012435 is a `hidden beast` number, since 5 + 0 + 610 + 1 + 2 + 43 + 5 = 666.
It is not a de Polignac number, because 5061012435 - 24 = 5061012419 is a prime.
It is a super-2 number, since 2×50610124352 = 51227693734449258450, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 5061012399 and 5061012408.
It is an unprimeable number.
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 39 ways as a sum of consecutive naturals, for example, 173152 + ... + 200258.
Almost surely, 25061012435 is an apocalyptic number.
5061012435 is a deficient number, since it is larger than the sum of its proper divisors (4031336061).
5061012435 is a wasteful number, since it uses less digits than its factorization.
5061012435 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27585 (or 27576 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 27.
The square root of 5061012435 is about 71140.7930444973. The cubic root of 5061012435 is about 1716.9031659380.
It can be divided in two parts, 506101 and 2435, that added together give a triangular number (508536 = T1008).
The spelling of 5061012435 in words is "five billion, sixty-one million, twelve thousand, four hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •