Base | Representation |
---|---|
bin | 100100011110100001100… |
… | …0100111110100000111111 |
3 | 122202021100010122210122200 |
4 | 1020331003010332200333 |
5 | 1124114321131300133 |
6 | 14355034024442543 |
7 | 1025126353460403 |
oct | 110750304764077 |
9 | 18667303583580 |
10 | 5013352212543 |
11 | 1663172698464 |
12 | 68b755619453 |
13 | 2a49ac41524c |
14 | 13490cbd7103 |
15 | 8a61ea47913 |
hex | 48f4313e83f |
5013352212543 has 12 divisors (see below), whose sum is σ = 7284871081488. Its totient is φ = 3322221425280.
The previous prime is 5013352212527. The next prime is 5013352212571. The reversal of 5013352212543 is 3452122533105.
5013352212543 is a `hidden beast` number, since 5 + 0 + 1 + 3 + 3 + 522 + 125 + 4 + 3 = 666.
It is not a de Polignac number, because 5013352212543 - 24 = 5013352212527 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5013352212498 and 5013352212507.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5013352212443) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1667780338 + ... + 1667783343.
It is an arithmetic number, because the mean of its divisors is an integer number (607072590124).
Almost surely, 25013352212543 is an apocalyptic number.
5013352212543 is a deficient number, since it is larger than the sum of its proper divisors (2271518868945).
5013352212543 is a wasteful number, since it uses less digits than its factorization.
5013352212543 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3335563854 (or 3335563851 counting only the distinct ones).
The product of its (nonzero) digits is 108000, while the sum is 36.
Adding to 5013352212543 its reverse (3452122533105), we get a palindrome (8465474745648).
The spelling of 5013352212543 in words is "five trillion, thirteen billion, three hundred fifty-two million, two hundred twelve thousand, five hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •