Search a number
-
+
15045767015393 is a prime number
BaseRepresentation
bin1101101011110001110110…
…0110010010101111100001
31222021100202101001122121202
43122330131212102233201
53433002212323443033
651555532511330545
73112010063332262
oct332743546225741
958240671048552
1015045767015393
114880968268644
12182bb78b20a55
13851a6b00518a
143a030cd64969
151b15955b18e8
hexdaf1d992be1

15045767015393 has 2 divisors, whose sum is σ = 15045767015394. Its totient is φ = 15045767015392.

The previous prime is 15045767015381. The next prime is 15045767015561. The reversal of 15045767015393 is 39351076754051.

It is a happy number.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 14178899878144 + 866867137249 = 3765488^2 + 931057^2 .

It is a cyclic number.

It is not a de Polignac number, because 15045767015393 - 28 = 15045767015137 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

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

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

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

Almost surely, 215045767015393 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 11907000, while the sum is 56.

The spelling of 15045767015393 in words is "fifteen trillion, forty-five billion, seven hundred sixty-seven million, fifteen thousand, three hundred ninety-three".