Search a number
-
+
14690934281 is a prime number
BaseRepresentation
bin11011010111010010…
…11101111000001001
31101220211120210020002
431223221131320021
5220041334344111
610425433412345
71030024611122
oct155351357011
941824523202
1014690934281
116259716401
122a1bb6a0b5
1315017c5a2a
149d5171049
155aeb1463b
hex36ba5de09

14690934281 has 2 divisors, whose sum is σ = 14690934282. Its totient is φ = 14690934280.

The previous prime is 14690934277. The next prime is 14690934299. The reversal of 14690934281 is 18243909641.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 7377263881 + 7313670400 = 85891^2 + 85520^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 14690934281 - 22 = 14690934277 is a prime.

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

It is not a weakly prime, because it can be changed into another prime (14690934211) 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, 7345467140 + 7345467141.

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

Almost surely, 214690934281 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 14690934281 in words is "fourteen billion, six hundred ninety million, nine hundred thirty-four thousand, two hundred eighty-one".