Search a number
-
+
15097207151969 is a prime number
BaseRepresentation
bin1101101110110001011110…
…1010110101110101100001
31222110021112022202100020022
43123230113222311311201
53434323040012330334
652035321120123225
73115510603305035
oct333542752656541
958407468670208
1015097207151969
1148a0764943608
121839b34166515
13856878237407
143a29cca541c5
151b2aa65c882e
hexdbb17ab5d61

15097207151969 has 2 divisors, whose sum is σ = 15097207151970. Its totient is φ = 15097207151968.

The previous prime is 15097207151959. The next prime is 15097207151977. The reversal of 15097207151969 is 96915170279051.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 14763169390369 + 334037761600 = 3842287^2 + 577960^2 .

It is an emirp because it is prime and its reverse (96915170279051) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 15097207151969 - 232 = 15092912184673 is a prime.

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

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

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

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

Almost surely, 215097207151969 is an apocalyptic number.

It is an amenable number.

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

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

15097207151969 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 10716300, while the sum is 62.

The spelling of 15097207151969 in words is "fifteen trillion, ninety-seven billion, two hundred seven million, one hundred fifty-one thousand, nine hundred sixty-nine".