Search a number
-
+
546994453 is a prime number
BaseRepresentation
bin100000100110100…
…111100100010101
31102010021012022211
4200212213210111
52110012310303
6130135553421
716361243005
oct4046474425
91363235284
10546994453
11260845035
1213322b871
138942a475
145290a005
153304c66d
hex209a7915

546994453 has 2 divisors, whose sum is σ = 546994454. Its totient is φ = 546994452.

The previous prime is 546994451. The next prime is 546994493. The reversal of 546994453 is 354499645.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 515880369 + 31114084 = 22713^2 + 5578^2 .

It is a cyclic number.

It is not a de Polignac number, because 546994453 - 21 = 546994451 is a prime.

It is a super-2 number, since 2×5469944532 = 598405863225538418, which contains 22 as substring.

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

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

It is a congruent number.

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

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

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

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

Almost surely, 2546994453 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 2332800, while the sum is 49.

The square root of 546994453 is about 23387.9125404556. The cubic root of 546994453 is about 817.8261143453.

The spelling of 546994453 in words is "five hundred forty-six million, nine hundred ninety-four thousand, four hundred fifty-three".