Search a number
-
+
1050105054511 is a prime number
BaseRepresentation
bin11110100011111110010…
…00111000010100101111
310201101111121220220210201
433101333020320110233
5114201103343221021
62122224523414331
7135603403455112
oct17217710702457
93641447826721
101050105054511
1137538aa21a57
1214b6260843a7
1378041a2b8a6
1438b7aac2579
151c4b045d591
hexf47f23852f

1050105054511 has 2 divisors, whose sum is σ = 1050105054512. Its totient is φ = 1050105054510.

The previous prime is 1050105054491. The next prime is 1050105054527. The reversal of 1050105054511 is 1154505010501.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 1050105054511 - 221 = 1050102957359 is a prime.

It is a super-3 number, since 3×10501050545113 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.

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

It is a congruent number.

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

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

Almost surely, 21050105054511 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 2500, while the sum is 28.

The spelling of 1050105054511 in words is "one trillion, fifty billion, one hundred five million, fifty-four thousand, five hundred eleven".