Search a number
-
+
201000101010511 = 1121661157859591
BaseRepresentation
bin101101101100111011111011…
…100111101101110001001111
3222100200102101122010100102111
4231230323323213231301033
5202321141201324314021
61551254101025004451
760223530610535035
oct5554737347556117
9870612348110374
10201000101010511
1159054733a5aa00
121a6631bb183727
1388202c746314a
14378c657642555
1518387196098e1
hexb6cefb9edc4f

201000101010511 has 6 divisors (see below), whose sum is σ = 220933995325736. Its totient is φ = 182727364554900.

The previous prime is 201000101010487. The next prime is 201000101010587. The reversal of 201000101010511 is 115010101000102.

It is not a de Polignac number, because 201000101010511 - 223 = 201000092621903 is a prime.

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

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (201000101016511) by changing a digit.

It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 830578929675 + ... + 830578929916.

Almost surely, 2201000101010511 is an apocalyptic number.

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

201000101010511 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 1661157859613 (or 1661157859602 counting only the distinct ones).

The product of its (nonzero) digits is 10, while the sum is 13.

Adding to 201000101010511 its reverse (115010101000102), we get a palindrome (316010202010613).

The spelling of 201000101010511 in words is "two hundred one trillion, one hundred one million, ten thousand, five hundred eleven".

Divisors: 1 11 121 1661157859591 18272736455501 201000101010511