Search a number
-
+
1250891521051 is a prime number
BaseRepresentation
bin10010001100111110111…
…100011101110000011011
311102120202210002020120111
4102030332330131300123
5130443311212133201
62354352430305151
7156242154331354
oct22147674356033
94376683066514
101250891521051
114425557200a7
121825210581b7
1390c5cc72983
1444787408d2b
1522812984b51
hex1233ef1dc1b

1250891521051 has 2 divisors, whose sum is σ = 1250891521052. Its totient is φ = 1250891521050.

The previous prime is 1250891521037. The next prime is 1250891521147. The reversal of 1250891521051 is 1501251980521.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 1250891521051 - 213 = 1250891512859 is a prime.

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

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

It is not a weakly prime, because it can be changed into another prime (1250891521001) 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, 625445760525 + 625445760526.

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

Almost surely, 21250891521051 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 36000, while the sum is 40.

The spelling of 1250891521051 in words is "one trillion, two hundred fifty billion, eight hundred ninety-one million, five hundred twenty-one thousand, fifty-one".