Base | Representation |
---|---|
bin | 100111011110011001100… |
… | …1010011000011100110011 |
3 | 201012122220121010120020112 |
4 | 1032330303022120130303 |
5 | 1202342210411220301 |
6 | 15312221214531535 |
7 | 1066654343364011 |
oct | 116746312303463 |
9 | 21178817116215 |
10 | 5425402054451 |
11 | 180199a024395 |
12 | 737590206bab |
13 | 3047c8319552 |
14 | 14a83b46d8b1 |
15 | 961d92599bb |
hex | 4ef33298733 |
5425402054451 has 2 divisors, whose sum is σ = 5425402054452. Its totient is φ = 5425402054450.
The previous prime is 5425402054403. The next prime is 5425402054511. The reversal of 5425402054451 is 1544502045245.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5425402054451 is a prime.
It is a super-2 number, since 2×54254020544512 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5425402054399 and 5425402054408.
It is not a weakly prime, because it can be changed into another prime (5425402051451) 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, 2712701027225 + 2712701027226.
It is an arithmetic number, because the mean of its divisors is an integer number (2712701027226).
Almost surely, 25425402054451 is an apocalyptic number.
5425402054451 is a deficient number, since it is larger than the sum of its proper divisors (1).
5425402054451 is an equidigital number, since it uses as much as digits as its factorization.
5425402054451 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 640000, while the sum is 41.
Adding to 5425402054451 its reverse (1544502045245), we get a palindrome (6969904099696).
The spelling of 5425402054451 in words is "five trillion, four hundred twenty-five billion, four hundred two million, fifty-four thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •