Search a number
-
+
14611121263 is a prime number
BaseRepresentation
bin11011001101110010…
…00000010001101111
31101201021101212100101
431212321000101233
5214410421340023
610413503011531
71025035324114
oct154671002157
941637355311
1014611121263
116218662732
1229b9299ba7
1314bb0cc7ab
149c871690b
155a7aeb1ad
hex366e4046f

14611121263 has 2 divisors, whose sum is σ = 14611121264. Its totient is φ = 14611121262.

The previous prime is 14611121237. The next prime is 14611121269. The reversal of 14611121263 is 36212111641.

14611121263 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

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

It is a cyclic number.

It is not a de Polignac number, because 14611121263 - 213 = 14611113071 is a prime.

It is a super-4 number, since 4×146111212634 (a number of 42 digits) contains 4444 as substring.

It is a congruent number.

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

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

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

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

Almost surely, 214611121263 is an apocalyptic number.

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

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

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

The product of its digits is 1728, while the sum is 28.

The spelling of 14611121263 in words is "fourteen billion, six hundred eleven million, one hundred twenty-one thousand, two hundred sixty-three".