Search a number
-
+
14720002536947 is a prime number
BaseRepresentation
bin1101011000110100010010…
…0001011011010111110011
31221010012220021201111210012
43112031010201123113303
53412133031122140242
651150135324125135
73046325246055251
oct326150441332763
957105807644705
1014720002536947
114765799756354
121798a030967ab
1382a123476466
1438c6481195d1
151a7d7b073282
hexd634485b5f3

14720002536947 has 2 divisors, whose sum is σ = 14720002536948. Its totient is φ = 14720002536946.

The previous prime is 14720002536931. The next prime is 14720002536977. The reversal of 14720002536947 is 74963520002741.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 14720002536947 - 24 = 14720002536931 is a prime.

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

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

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

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

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

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

Almost surely, 214720002536947 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 2540160, while the sum is 50.

The spelling of 14720002536947 in words is "fourteen trillion, seven hundred twenty billion, two million, five hundred thirty-six thousand, nine hundred forty-seven".