Base | Representation |
---|---|
bin | 100100100010110000110… |
… | …0011110010110011111111 |
3 | 122210010211102102020202011 |
4 | 1021011201203302303333 |
5 | 1124241441101322033 |
6 | 14403141105512051 |
7 | 1025601036502132 |
oct | 111054143626377 |
9 | 18703742366664 |
10 | 5022453542143 |
11 | 16670130a9064 |
12 | 691475642627 |
13 | 2a57ccb8328b |
14 | 135133868219 |
15 | 8a9a3a8cccd |
hex | 491618f2cff |
5022453542143 has 2 divisors, whose sum is σ = 5022453542144. Its totient is φ = 5022453542142.
The previous prime is 5022453542137. The next prime is 5022453542159. The reversal of 5022453542143 is 3412453542205.
5022453542143 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 5022453542143 - 25 = 5022453542111 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5022453542096 and 5022453542105.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5022453542173) 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, 2511226771071 + 2511226771072.
It is an arithmetic number, because the mean of its divisors is an integer number (2511226771072).
Almost surely, 25022453542143 is an apocalyptic number.
5022453542143 is a deficient number, since it is larger than the sum of its proper divisors (1).
5022453542143 is an equidigital number, since it uses as much as digits as its factorization.
5022453542143 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 576000, while the sum is 40.
The spelling of 5022453542143 in words is "five trillion, twenty-two billion, four hundred fifty-three million, five hundred forty-two thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •