Base | Representation |
---|---|
bin | 100100110001000011010… |
… | …1111000001010011100000 |
3 | 122220002001011012002210112 |
4 | 1021202012233001103200 |
5 | 1130242313323410102 |
6 | 14425214214150452 |
7 | 1031035366264112 |
oct | 111420657012340 |
9 | 18802034162715 |
10 | 5053142013152 |
11 | 1679030a275a2 |
12 | 6973bb052428 |
13 | 2a8680a7bc6c |
14 | 1368054c93b2 |
15 | 8b69cd5d252 |
hex | 49886bc14e0 |
5053142013152 has 12 divisors (see below), whose sum is σ = 9948373338456. Its totient is φ = 2526571006560.
The previous prime is 5053142013133. The next prime is 5053142013163. The reversal of 5053142013152 is 2513102413505.
It is a Harshad number since it is a multiple of its sum of digits (32), and also a Moran number because the ratio is a prime number: 157910687911 = 5053142013152 / (5 + 0 + 5 + 3 + 1 + 4 + 2 + 0 + 1 + 3 + 1 + 5 + 2).
It is a congruent number.
It is an unprimeable number.
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 as a sum of consecutive naturals, namely, 78955343924 + ... + 78955343987.
It is an arithmetic number, because the mean of its divisors is an integer number (829031111538).
Almost surely, 25053142013152 is an apocalyptic number.
It is an amenable number.
5053142013152 is a deficient number, since it is larger than the sum of its proper divisors (4895231325304).
5053142013152 is a wasteful number, since it uses less digits than its factorization.
5053142013152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 157910687921 (or 157910687913 counting only the distinct ones).
The product of its (nonzero) digits is 18000, while the sum is 32.
Adding to 5053142013152 its reverse (2513102413505), we get a palindrome (7566244426657).
The spelling of 5053142013152 in words is "five trillion, fifty-three billion, one hundred forty-two million, thirteen thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •