Search a number
-
+
15051969041 is a prime number
BaseRepresentation
bin11100000010010101…
…01101001000010001
31102211222221020210212
432001022231020101
5221311301002131
610525331533505
71042000424444
oct160112551021
942758836725
1015051969041
11642449813a
122b00a5a295
13155b543775
14a2b0b165b
155d167ca2b
hex3812ad211

15051969041 has 2 divisors, whose sum is σ = 15051969042. Its totient is φ = 15051969040.

The previous prime is 15051969029. The next prime is 15051969047. The reversal of 15051969041 is 14096915051.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 13573182016 + 1478787025 = 116504^2 + 38455^2 .

It is a cyclic number.

It is not a de Polignac number, because 15051969041 - 230 = 13978227217 is a prime.

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

It is a self number, because there is not a number n which added to its sum of digits gives 15051969041.

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

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

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

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

Almost surely, 215051969041 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 48600, while the sum is 41.

The spelling of 15051969041 in words is "fifteen billion, fifty-one million, nine hundred sixty-nine thousand, forty-one".