Base | Representation |
---|---|
bin | 100001000011001110110… |
… | …0001001110100001111101 |
3 | 121002020210021120111012222 |
4 | 1002012131201032201331 |
5 | 1043410340312240203 |
6 | 13354432124535125 |
7 | 646115323560434 |
oct | 102063541164175 |
9 | 17066707514188 |
10 | 4542423165053 |
11 | 14a1481501954 |
12 | 6144283b14a5 |
13 | 26c46c035627 |
14 | 119bd68a011b |
15 | 7d25b1c5038 |
hex | 4219d84e87d |
4542423165053 has 2 divisors, whose sum is σ = 4542423165054. Its totient is φ = 4542423165052.
The previous prime is 4542423165029. The next prime is 4542423165079. The reversal of 4542423165053 is 3505613242454.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2860789983769 + 1681633181284 = 1691387^2 + 1296778^2 .
It is a cyclic number.
It is not a de Polignac number, because 4542423165053 - 218 = 4542422902909 is a prime.
It is a super-2 number, since 2×45424231650532 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 4542423164995 and 4542423165013.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4542423065053) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2271211582526 + 2271211582527.
It is an arithmetic number, because the mean of its divisors is an integer number (2271211582527).
Almost surely, 24542423165053 is an apocalyptic number.
It is an amenable number.
4542423165053 is a deficient number, since it is larger than the sum of its proper divisors (1).
4542423165053 is an equidigital number, since it uses as much as digits as its factorization.
4542423165053 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1728000, while the sum is 44.
The spelling of 4542423165053 in words is "four trillion, five hundred forty-two billion, four hundred twenty-three million, one hundred sixty-five thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •