Search a number
-
+
14030561503397 is a prime number
BaseRepresentation
bin1100110000101011111010…
…1000100110100010100101
31211200022022221210011222202
43030022332220212202211
53314334042221102042
645501315002104245
72645450252011415
oct314127650464245
954608287704882
1014030561503397
11451a36721350a
1216a72727ab085
137aa0cb75647a
143671232bc645
15194e78e8d632
hexcc2bea268a5

14030561503397 has 2 divisors, whose sum is σ = 14030561503398. Its totient is φ = 14030561503396.

The previous prime is 14030561503297. The next prime is 14030561503447. The reversal of 14030561503397 is 79330516503041.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 7797754662916 + 6232806840481 = 2792446^2 + 2496559^2 .

It is a cyclic number.

It is not a de Polignac number, because 14030561503397 - 212 = 14030561499301 is a prime.

It is a super-2 number, since 2×140305615033972 (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 (14030561503297) by changing a digit.

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

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

Almost surely, 214030561503397 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 14030561503397 in words is "fourteen trillion, thirty billion, five hundred sixty-one million, five hundred three thousand, three hundred ninety-seven".