Search a number
-
+
495050054951 = 1724232871137
BaseRepresentation
bin1110011010000110100…
…10000101110100100111
31202022210220000110011102
413031003102011310213
531102330303224301
61015231200430315
750523542015564
oct7150322056447
91668726013142
10495050054951
11180a49939521
127bb3b31839b
13378b57965ca
1419d63a7186b
15cd262b7b6b
hex7343485d27

495050054951 has 4 divisors (see below), whose sum is σ = 495053098512. Its totient is φ = 495047011392.

The previous prime is 495050054911. The next prime is 495050055023. The reversal of 495050054951 is 159450050594.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 495050054951 - 26 = 495050054887 is a prime.

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

It is a Duffinian number.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (495050054911) by changing a digit.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1263146 + ... + 1607991.

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

Almost surely, 2495050054951 is an apocalyptic number.

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

495050054951 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 3043560.

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

The spelling of 495050054951 in words is "four hundred ninety-five billion, fifty million, fifty-four thousand, nine hundred fifty-one".

Divisors: 1 172423 2871137 495050054951