Base | Representation |
---|---|
bin | 100100101110110001101… |
… | …1000110111100100011101 |
3 | 122212121102111121011001002 |
4 | 1021131203120313210131 |
5 | 1130202311013130003 |
6 | 14423045204000045 |
7 | 1030503304205441 |
oct | 111354330674435 |
9 | 18777374534032 |
10 | 5048254036253 |
11 | 1676a5288316a |
12 | 696476090025 |
13 | 2a80821b353c |
14 | 1364a0268821 |
15 | 8b4b3b83a88 |
hex | 4976363791d |
5048254036253 has 2 divisors, whose sum is σ = 5048254036254. Its totient is φ = 5048254036252.
The previous prime is 5048254036219. The next prime is 5048254036261. The reversal of 5048254036253 is 3526304528405.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3271370368249 + 1776883668004 = 1808693^2 + 1332998^2 .
It is a cyclic number.
It is not a de Polignac number, because 5048254036253 - 216 = 5048253970717 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5048254036198 and 5048254036207.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5048254336253) 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 as a sum of consecutive naturals, namely, 2524127018126 + 2524127018127.
It is an arithmetic number, because the mean of its divisors is an integer number (2524127018127).
Almost surely, 25048254036253 is an apocalyptic number.
It is an amenable number.
5048254036253 is a deficient number, since it is larger than the sum of its proper divisors (1).
5048254036253 is an equidigital number, since it uses as much as digits as its factorization.
5048254036253 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3456000, while the sum is 47.
The spelling of 5048254036253 in words is "five trillion, forty-eight billion, two hundred fifty-four million, thirty-six thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •