Base | Representation |
---|---|
bin | 100100011110101010000… |
… | …0011000000100111110011 |
3 | 122202022001222100220112110 |
4 | 1020331110003000213303 |
5 | 1124120412022101210 |
6 | 14355122154500403 |
7 | 1025136411403011 |
oct | 110752403004763 |
9 | 18668058326473 |
10 | 5013636909555 |
11 | 16632a936a54a |
12 | 68b814a34703 |
13 | 2a4a263b5811 |
14 | 1349389458b1 |
15 | 8a639a32420 |
hex | 48f540c09f3 |
5013636909555 has 16 divisors (see below), whose sum is σ = 8095413728160. Its totient is φ = 2649408127488.
The previous prime is 5013636909529. The next prime is 5013636909563. The reversal of 5013636909555 is 5559096363105.
It is not a de Polignac number, because 5013636909555 - 210 = 5013636908531 is a prime.
It is a super-2 number, since 2×50136369095552 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5013636909495 and 5013636909504.
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 15 ways as a sum of consecutive naturals, for example, 1533220662 + ... + 1533223931.
It is an arithmetic number, because the mean of its divisors is an integer number (505963358010).
Almost surely, 25013636909555 is an apocalyptic number.
5013636909555 is a deficient number, since it is larger than the sum of its proper divisors (3081776818605).
5013636909555 is a wasteful number, since it uses less digits than its factorization.
5013636909555 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3066444710.
The product of its (nonzero) digits is 16402500, while the sum is 57.
The spelling of 5013636909555 in words is "five trillion, thirteen billion, six hundred thirty-six million, nine hundred nine thousand, five hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •