Search a number
-
+
36423219061 is a prime number
BaseRepresentation
bin100001111010111111…
…100011011101110101
310111000101201020110101
4201322333203131311
51044043321002221
624422123554101
72426413153015
oct417277433565
9114011636411
1036423219061
11144a0a59639
12708608b931
133586041b38
141a97543c45
15e329aed91
hex87afe3775

36423219061 has 2 divisors, whose sum is σ = 36423219062. Its totient is φ = 36423219060.

The previous prime is 36423218977. The next prime is 36423219067. The reversal of 36423219061 is 16091232463.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 25290858961 + 11132360100 = 159031^2 + 105510^2 .

It is an emirp because it is prime and its reverse (16091232463) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 36423219061 - 27 = 36423218933 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 36423219061.

It is a congruent number.

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

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

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

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

Almost surely, 236423219061 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 46656, while the sum is 37.

The spelling of 36423219061 in words is "thirty-six billion, four hundred twenty-three million, two hundred nineteen thousand, sixty-one".