Search a number
-
+
36914692344469 is a prime number
BaseRepresentation
bin10000110010010110111110…
…00111111100101010010101
311211201000021101020211020221
420121023133013330222111
514314302242220010334
6210302213041354341
710526666326504432
oct1031133707745225
9154630241224227
1036914692344469
1110842484512145
1241823939389b1
13177a06b1259a4
1491897597cb89
154403810808b4
hex2192df1fca95

36914692344469 has 2 divisors, whose sum is σ = 36914692344470. Its totient is φ = 36914692344468.

The previous prime is 36914692344463. The next prime is 36914692344499. The reversal of 36914692344469 is 96444329641963.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 21178753753444 + 15735938591025 = 4602038^2 + 3966855^2 .

It is a cyclic number.

It is not a de Polignac number, because 36914692344469 - 221 = 36914690247317 is a prime.

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

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

It is a congruent number.

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

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

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

Almost surely, 236914692344469 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 725594112, while the sum is 70.

The spelling of 36914692344469 in words is "thirty-six trillion, nine hundred fourteen billion, six hundred ninety-two million, three hundred forty-four thousand, four hundred sixty-nine".