Base | Representation |
---|---|
bin | 100001000011010101101… |
… | …0010110010010001110101 |
3 | 121002021101101102100100201 |
4 | 1002012223102302101311 |
5 | 1043411323442312331 |
6 | 13354511102040501 |
7 | 646124131054561 |
oct | 102065322622165 |
9 | 17067341370321 |
10 | 4542654260341 |
11 | 14a158a9a319a |
12 | 614491879131 |
13 | 26c4a7b892c2 |
14 | 119c194586a1 |
15 | 7d271622a61 |
hex | 421ab4b2475 |
4542654260341 has 2 divisors, whose sum is σ = 4542654260342. Its totient is φ = 4542654260340.
The previous prime is 4542654260321. The next prime is 4542654260383. The reversal of 4542654260341 is 1430624562454.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4145483314116 + 397170946225 = 2036046^2 + 630215^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4542654260341 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 4542654260291 and 4542654260300.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4542654260321) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2271327130170 + 2271327130171.
It is an arithmetic number, because the mean of its divisors is an integer number (2271327130171).
Almost surely, 24542654260341 is an apocalyptic number.
It is an amenable number.
4542654260341 is a deficient number, since it is larger than the sum of its proper divisors (1).
4542654260341 is an equidigital number, since it uses as much as digits as its factorization.
4542654260341 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2764800, while the sum is 46.
The spelling of 4542654260341 in words is "four trillion, five hundred forty-two billion, six hundred fifty-four million, two hundred sixty thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •