Base | Representation |
---|---|
bin | 1111110001110010010… |
… | …10111100110101000001 |
3 | 1220211022121221000222001 |
4 | 13320321022330311001 |
5 | 32340233003114301 |
6 | 1053014313144001 |
7 | 54111235621606 |
oct | 7707112746501 |
9 | 1824277830861 |
10 | 542125051201 |
11 | 199a065049a8 |
12 | 890986bb001 |
13 | 3c17854c786 |
14 | 1c34bb1c6ad |
15 | e17de7ec01 |
hex | 7e392bcd41 |
542125051201 has 2 divisors, whose sum is σ = 542125051202. Its totient is φ = 542125051200.
The previous prime is 542125051163. The next prime is 542125051219. The reversal of 542125051201 is 102150521245.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 521825640625 + 20299410576 = 722375^2 + 142476^2 .
It is a cyclic number.
It is not a de Polignac number, because 542125051201 - 27 = 542125051073 is a prime.
It is a super-2 number, since 2×5421250512012 (a number of 24 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 542125051201.
It is not a weakly prime, because it can be changed into another prime (542125051271) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 271062525600 + 271062525601.
It is an arithmetic number, because the mean of its divisors is an integer number (271062525601).
Almost surely, 2542125051201 is an apocalyptic number.
It is an amenable number.
542125051201 is a deficient number, since it is larger than the sum of its proper divisors (1).
542125051201 is an equidigital number, since it uses as much as digits as its factorization.
542125051201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4000, while the sum is 28.
Adding to 542125051201 its reverse (102150521245), we get a palindrome (644275572446).
The spelling of 542125051201 in words is "five hundred forty-two billion, one hundred twenty-five million, fifty-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •