Base | Representation |
---|---|
bin | 100100101111000111101… |
… | …0100110101001001010101 |
3 | 122212200022212122200122112 |
4 | 1021132033110311021111 |
5 | 1130210313220102003 |
6 | 14423250255240405 |
7 | 1030530464610644 |
oct | 111361724651125 |
9 | 18780285580575 |
10 | 5048991175253 |
11 | 16772a0989653 |
12 | 696640b19105 |
13 | 2a816bb2716c |
14 | 13653010d35b |
15 | 8b5087403d8 |
hex | 4978f535255 |
5048991175253 has 8 divisors (see below), whose sum is σ = 5053899549600. Its totient is φ = 5044083084880.
The previous prime is 5048991175243. The next prime is 5048991175273. The reversal of 5048991175253 is 3525711998405.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5048991175253 - 222 = 5048986980949 is a prime.
It is a super-2 number, since 2×50489911752532 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5048991175192 and 5048991175201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5048991175213) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 59478626 + ... + 59563452.
It is an arithmetic number, because the mean of its divisors is an integer number (631737443700).
Almost surely, 25048991175253 is an apocalyptic number.
It is an amenable number.
5048991175253 is a deficient number, since it is larger than the sum of its proper divisors (4908374347).
5048991175253 is a wasteful number, since it uses less digits than its factorization.
5048991175253 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 141987.
The product of its (nonzero) digits is 13608000, while the sum is 59.
The spelling of 5048991175253 in words is "five trillion, forty-eight billion, nine hundred ninety-one million, one hundred seventy-five thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •