Base | Representation |
---|---|
bin | 111101011100011000111100… |
… | …1100001010010101111010101 |
3 | 2121212121210212121020201202221 |
4 | 1322320301321201102233111 |
5 | 1031314423314104230401 |
6 | 5153245305122302341 |
7 | 221561126303252224 |
oct | 17270617141225725 |
9 | 2555553777221687 |
10 | 540463543430101 |
11 | 147232335457825 |
12 | 507495571b79b1 |
13 | 1a27565518b165 |
14 | 976680a012cbb |
15 | 4273a6c8a17a1 |
hex | 1eb8c79852bd5 |
540463543430101 has 2 divisors, whose sum is σ = 540463543430102. Its totient is φ = 540463543430100.
The previous prime is 540463543430071. The next prime is 540463543430263. The reversal of 540463543430101 is 101034345364045.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 449651982590001 + 90811560840100 = 21204999^2 + 9529510^2 .
It is a cyclic number.
It is not a de Polignac number, because 540463543430101 - 237 = 540326104476629 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (540463543430501) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 270231771715050 + 270231771715051.
It is an arithmetic number, because the mean of its divisors is an integer number (270231771715051).
Almost surely, 2540463543430101 is an apocalyptic number.
It is an amenable number.
540463543430101 is a deficient number, since it is larger than the sum of its proper divisors (1).
540463543430101 is an equidigital number, since it uses as much as digits as its factorization.
540463543430101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1036800, while the sum is 43.
Adding to 540463543430101 its reverse (101034345364045), we get a palindrome (641497888794146).
The spelling of 540463543430101 in words is "five hundred forty trillion, four hundred sixty-three billion, five hundred forty-three million, four hundred thirty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •