Base | Representation |
---|---|
bin | 100100100010101111011… |
… | …1110111000101011011101 |
3 | 122210010201102001221201001 |
4 | 1021011132332320223131 |
5 | 1124241344014444123 |
6 | 14403132523150301 |
7 | 1025600003163004 |
oct | 111053676705335 |
9 | 18703642057631 |
10 | 5022410312413 |
11 | 1666aa0761a0a |
12 | 691463075391 |
13 | 2a57c3c28660 |
14 | 13512bc13c3b |
15 | 8a99ed9e0ad |
hex | 4915efb8add |
5022410312413 has 32 divisors (see below), whose sum is σ = 5630674664160. Its totient is φ = 4447913057280.
The previous prime is 5022410312401. The next prime is 5022410312419. The reversal of 5022410312413 is 3142130142205.
It can be written as a sum of positive squares in 16 ways, for example, as 2522131486884 + 2500278825529 = 1588122^2 + 1581227^2 .
It is a de Polignac number, because none of the positive numbers 2k-5022410312413 is a prime.
It is a super-4 number, since 4×50224103124134 (a number of 52 digits) contains 4444 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5022410312419) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 87109831 + ... + 87167467.
It is an arithmetic number, because the mean of its divisors is an integer number (175958583255).
Almost surely, 25022410312413 is an apocalyptic number.
It is an amenable number.
5022410312413 is a deficient number, since it is larger than the sum of its proper divisors (608264351747).
5022410312413 is a wasteful number, since it uses less digits than its factorization.
5022410312413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59137.
The product of its (nonzero) digits is 5760, while the sum is 28.
Adding to 5022410312413 its reverse (3142130142205), we get a palindrome (8164540454618).
The spelling of 5022410312413 in words is "five trillion, twenty-two billion, four hundred ten million, three hundred twelve thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •