Search a number
-
+
469781932051 is a prime number
BaseRepresentation
bin1101101011000010010…
…11110110100000010011
31122220120220120210212201
412311201023312200103
530144103133311201
6555452001104031
745640430352025
oct6654113664023
91586526523781
10469781932051
11171262720823
1277069028017
13353b98437b3
1418a47c52015
15c347cd1801
hex6d612f6813

469781932051 has 2 divisors, whose sum is σ = 469781932052. Its totient is φ = 469781932050.

The previous prime is 469781932019. The next prime is 469781932091. The reversal of 469781932051 is 150239187964.

It is a happy number.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 469781932051 - 25 = 469781932019 is a prime.

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

It is not a weakly prime, because it can be changed into another prime (469781932091) 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 as a sum of consecutive naturals, namely, 234890966025 + 234890966026.

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

It is a 1-persistent number, because it is pandigital, but 2⋅469781932051 = 939563864102 is not.

Almost surely, 2469781932051 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 3265920, while the sum is 55.

The spelling of 469781932051 in words is "four hundred sixty-nine billion, seven hundred eighty-one million, nine hundred thirty-two thousand, fifty-one".