Search a number
-
+
15047603335189 is a prime number
BaseRepresentation
bin1101101011111000101100…
…0011010011000000010101
31222021112111100102100211001
43122332023003103000111
53433014442423211224
652000435030143301
73112103431646305
oct332761303230025
958245440370731
1015047603335189
11488171a879907
1218303abab1b31
13851ca15a0939
143a0444bb3605
151b16518e1544
hexdaf8b0d3015

15047603335189 has 2 divisors, whose sum is σ = 15047603335190. Its totient is φ = 15047603335188.

The previous prime is 15047603335151. The next prime is 15047603335217. The reversal of 15047603335189 is 98153330674051.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 13991265440100 + 1056337895089 = 3740490^2 + 1027783^2 .

It is a cyclic number.

It is not a de Polignac number, because 15047603335189 - 225 = 15047569780757 is a prime.

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

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

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

Almost surely, 215047603335189 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 8164800, while the sum is 55.

The spelling of 15047603335189 in words is "fifteen trillion, forty-seven billion, six hundred three million, three hundred thirty-five thousand, one hundred eighty-nine".