Base | Representation |
---|---|
bin | 100100101101011111101… |
… | …1000110011000011110001 |
3 | 122212100022202012101110001 |
4 | 1021122333120303003301 |
5 | 1130131142123214403 |
6 | 14421512154110001 |
7 | 1030345154043352 |
oct | 111327730630361 |
9 | 18770282171401 |
10 | 5045502554353 |
11 | 1675870724088 |
12 | 695a2871b301 |
13 | 2a7a34143041 |
14 | 1362bca73d29 |
15 | 8b3a232ec1d |
hex | 496bf6330f1 |
5045502554353 has 2 divisors, whose sum is σ = 5045502554354. Its totient is φ = 5045502554352.
The previous prime is 5045502554341. The next prime is 5045502554357. The reversal of 5045502554353 is 3534552055405.
5045502554353 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2725708544784 + 2319794009569 = 1650972^2 + 1523087^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5045502554353 is a prime.
It is not a weakly prime, because it can be changed into another prime (5045502554357) 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, 2522751277176 + 2522751277177.
It is an arithmetic number, because the mean of its divisors is an integer number (2522751277177).
Almost surely, 25045502554353 is an apocalyptic number.
It is an amenable number.
5045502554353 is a deficient number, since it is larger than the sum of its proper divisors (1).
5045502554353 is an equidigital number, since it uses as much as digits as its factorization.
5045502554353 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4500000, while the sum is 46.
The spelling of 5045502554353 in words is "five trillion, forty-five billion, five hundred two million, five hundred fifty-four thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •