Base | Representation |
---|---|
bin | 100110111101010111001… |
… | …1010100000010100110111 |
3 | 200221212210012112211222122 |
4 | 1031322232122200110313 |
5 | 1200211411042401201 |
6 | 15215445230350155 |
7 | 1061563253146406 |
oct | 115725632402467 |
9 | 20855705484878 |
10 | 5354455434551 |
11 | 17848a2558823 |
12 | 72589035b35b |
13 | 2cabcca347a2 |
14 | 14722ac4363d |
15 | 944359ade1b |
hex | 4deae6a0537 |
5354455434551 has 8 divisors (see below), whose sum is σ = 5382408954864. Its totient is φ = 5326504081920.
The previous prime is 5354455434487. The next prime is 5354455434553. The reversal of 5354455434551 is 1554345544535.
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 5354455434551 - 26 = 5354455434487 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5354455434493 and 5354455434502.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5354455434553) 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 in 7 ways as a sum of consecutive naturals, for example, 4535036 + ... + 5592446.
It is an arithmetic number, because the mean of its divisors is an integer number (672801119358).
Almost surely, 25354455434551 is an apocalyptic number.
5354455434551 is a deficient number, since it is larger than the sum of its proper divisors (27953520313).
5354455434551 is a wasteful number, since it uses less digits than its factorization.
5354455434551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1083841.
The product of its digits is 36000000, while the sum is 53.
The spelling of 5354455434551 in words is "five trillion, three hundred fifty-four billion, four hundred fifty-five million, four hundred thirty-four thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •