Base | Representation |
---|---|
bin | 100110001010011101001… |
… | …1100011111001001001111 |
3 | 200120102121112000121011010 |
4 | 1030110322130133021033 |
5 | 1141414014204131133 |
6 | 15053325415300303 |
7 | 1050643231051116 |
oct | 114247234371117 |
9 | 20512545017133 |
10 | 5245135614543 |
11 | 17424a434aa40 |
12 | 70866137a693 |
13 | 2c07ca427766 |
14 | 141c1a118c7d |
15 | 91688471263 |
hex | 4c53a71f24f |
5245135614543 has 32 divisors (see below), whose sum is σ = 7691333075712. Its totient is φ = 3153088972800.
The previous prime is 5245135614533. The next prime is 5245135614569. The reversal of 5245135614543 is 3454165315425.
It is a happy number.
It is not a de Polignac number, because 5245135614543 - 213 = 5245135606351 is a prime.
It is a super-2 number, since 2×52451356145432 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5245135614492 and 5245135614501.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5245135614503) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2071855 + ... + 3844847.
It is an arithmetic number, because the mean of its divisors is an integer number (240354158616).
Almost surely, 25245135614543 is an apocalyptic number.
5245135614543 is a deficient number, since it is larger than the sum of its proper divisors (2446197461169).
5245135614543 is a wasteful number, since it uses less digits than its factorization.
5245135614543 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1773735.
The product of its digits is 4320000, while the sum is 48.
The spelling of 5245135614543 in words is "five trillion, two hundred forty-five billion, one hundred thirty-five million, six hundred fourteen thousand, five hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •