Search a number
-
+
14096299549861 is a prime number
BaseRepresentation
bin1100110100100000110011…
…1011010110010010100101
31211220121000100111221201101
43031020030323112102211
53321423210141043421
645551430044400101
72653265305125514
oct315101473262245
954817010457641
1014096299549861
114545230673831
1216b7b5a246031
137b3376c12c09
1436a39bc7267b
15196a25333191
hexcd20ced64a5

14096299549861 has 2 divisors, whose sum is σ = 14096299549862. Its totient is φ = 14096299549860.

The previous prime is 14096299549811. The next prime is 14096299549879. The reversal of 14096299549861 is 16894599269041.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 13839843397636 + 256456152225 = 3720194^2 + 506415^2 .

It is a cyclic number.

It is not a de Polignac number, because 14096299549861 - 213 = 14096299541669 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 214096299549861 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 302330880, while the sum is 73.

The spelling of 14096299549861 in words is "fourteen trillion, ninety-six billion, two hundred ninety-nine million, five hundred forty-nine thousand, eight hundred sixty-one".