Base | Representation |
---|---|
bin | 1111101110101001111… |
… | …11000001011000101101 |
3 | 1220122222111010002001222 |
4 | 13313110333001120231 |
5 | 32323312203440131 |
6 | 1052135430513125 |
7 | 54021465632315 |
oct | 7672477013055 |
9 | 1818874102058 |
10 | 540444202541 |
11 | 199223732481 |
12 | 888a98057a5 |
13 | 3bc6b24a279 |
14 | 1c22c7c0445 |
15 | e0d161087b |
hex | 7dd4fc162d |
540444202541 has 2 divisors, whose sum is σ = 540444202542. Its totient is φ = 540444202540.
The previous prime is 540444202523. The next prime is 540444202589. The reversal of 540444202541 is 145202444045.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 278662573225 + 261781629316 = 527885^2 + 511646^2 .
It is a cyclic number.
It is not a de Polignac number, because 540444202541 - 214 = 540444186157 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (540444202591) 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, 270222101270 + 270222101271.
It is an arithmetic number, because the mean of its divisors is an integer number (270222101271).
Almost surely, 2540444202541 is an apocalyptic number.
It is an amenable number.
540444202541 is a deficient number, since it is larger than the sum of its proper divisors (1).
540444202541 is an equidigital number, since it uses as much as digits as its factorization.
540444202541 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 102400, while the sum is 35.
Adding to 540444202541 its reverse (145202444045), we get a palindrome (685646646586).
The spelling of 540444202541 in words is "five hundred forty billion, four hundred forty-four million, two hundred two thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •