Search a number
-
+
1050010601011 is a prime number
BaseRepresentation
bin11110100011110011000…
…00100100011000110011
310201101021001012011221221
433101321200210120303
5114200410203213021
62122211311125511
7135601145563351
oct17217140443063
93641231164857
101050010601011
11375341679709
1214b5ba513897
13780282aa848
1438b6c3367d1
151c4a7002241
hexf479824633

1050010601011 has 2 divisors, whose sum is σ = 1050010601012. Its totient is φ = 1050010601010.

The previous prime is 1050010600981. The next prime is 1050010601023. The reversal of 1050010601011 is 1101060100501.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 1050010601011 - 217 = 1050010469939 is a prime.

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

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

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

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

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

Almost surely, 21050010601011 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 30, while the sum is 16.

Adding to 1050010601011 its reverse (1101060100501), we get a palindrome (2151070701512).

The spelling of 1050010601011 in words is "one trillion, fifty billion, ten million, six hundred one thousand, eleven".