Base | Representation |
---|---|
bin | 100100110001000101011… |
… | …1010100010001000010101 |
3 | 122220002020001010220211011 |
4 | 1021202022322202020111 |
5 | 1130242434301440203 |
6 | 14425225201212221 |
7 | 1031040210326530 |
oct | 111421272421025 |
9 | 18802201126734 |
10 | 5053212140053 |
11 | 1679067574a10 |
12 | 69741a631071 |
13 | 2a869246347c |
14 | 136810941a17 |
15 | 8b6a40b176d |
hex | 4988aea2215 |
5053212140053 has 32 divisors (see below), whose sum is σ = 6632648432640. Its totient is φ = 3729790229760.
The previous prime is 5053212140029. The next prime is 5053212140087. The reversal of 5053212140053 is 3500412123505.
It is not a de Polignac number, because 5053212140053 - 25 = 5053212140021 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5053212139997 and 5053212140024.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5053212140453) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 10058701 + ... + 10549117.
It is an arithmetic number, because the mean of its divisors is an integer number (207270263520).
Almost surely, 25053212140053 is an apocalyptic number.
It is an amenable number.
5053212140053 is a deficient number, since it is larger than the sum of its proper divisors (1579436292587).
5053212140053 is a wasteful number, since it uses less digits than its factorization.
5053212140053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 497497.
The product of its (nonzero) digits is 18000, while the sum is 31.
Adding to 5053212140053 its reverse (3500412123505), we get a palindrome (8553624263558).
The spelling of 5053212140053 in words is "five trillion, fifty-three billion, two hundred twelve million, one hundred forty thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •