Search a number
-
+
546022950059 is a prime number
BaseRepresentation
bin1111111001000011000…
…00010000010010101011
31221012101021111210222102
413330201200100102223
532421223333400214
61054501154444015
754306646332326
oct7744140202253
91835337453872
10546022950059
111a06267a2014
12899a5b9360b
133c649c731c2
141c5db6957bd
15e30b287bde
hex7f218104ab

546022950059 has 2 divisors, whose sum is σ = 546022950060. Its totient is φ = 546022950058.

The previous prime is 546022949963. The next prime is 546022950061. The reversal of 546022950059 is 950059220645.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 546022950059 - 216 = 546022884523 is a prime.

It is a super-2 number, since 2×5460229500592 (a number of 24 digits) contains 22 as substring.

Together with 546022950061, it forms a pair of twin primes.

It is a Chen prime.

It is a junction number, because it is equal to n+sod(n) for n = 546022949995 and 546022950022.

It is not a weakly prime, because it can be changed into another prime (546022950959) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 273011475029 + 273011475030.

It is an arithmetic number, because the mean of its divisors is an integer number (273011475030).

Almost surely, 2546022950059 is an apocalyptic number.

546022950059 is a deficient number, since it is larger than the sum of its proper divisors (1).

546022950059 is an equidigital number, since it uses as much as digits as its factorization.

546022950059 is an odious number, because the sum of its binary digits is odd.

The product of its (nonzero) digits is 972000, while the sum is 47.

The spelling of 546022950059 in words is "five hundred forty-six billion, twenty-two million, nine hundred fifty thousand, fifty-nine".