Base | Representation |
---|---|
bin | 1111110010011111100… |
… | …10011110101000010101 |
3 | 1220212022001221122100111 |
4 | 13321033302132220111 |
5 | 32342022123341041 |
6 | 1053120110243021 |
7 | 54123524160433 |
oct | 7711762365025 |
9 | 1825261848314 |
10 | 542504512021 |
11 | 19a09072148a |
12 | 891837b6471 |
13 | 3c20904c3c4 |
14 | 1c386297d53 |
15 | e1a2437981 |
hex | 7e4fc9ea15 |
542504512021 has 2 divisors, whose sum is σ = 542504512022. Its totient is φ = 542504512020.
The previous prime is 542504511979. The next prime is 542504512087. The reversal of 542504512021 is 120215405245.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 520374676900 + 22129835121 = 721370^2 + 148761^2 .
It is a cyclic number.
It is not a de Polignac number, because 542504512021 - 227 = 542370294293 is a prime.
It is a super-2 number, since 2×5425045120212 (a number of 24 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (542504518021) 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, 271252256010 + 271252256011.
It is an arithmetic number, because the mean of its divisors is an integer number (271252256011).
Almost surely, 2542504512021 is an apocalyptic number.
It is an amenable number.
542504512021 is a deficient number, since it is larger than the sum of its proper divisors (1).
542504512021 is an equidigital number, since it uses as much as digits as its factorization.
542504512021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16000, while the sum is 31.
Adding to 542504512021 its reverse (120215405245), we get a palindrome (662719917266).
The spelling of 542504512021 in words is "five hundred forty-two billion, five hundred four million, five hundred twelve thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •