Search a number
-
+
102010201111 = 7213160141603
BaseRepresentation
bin101111100000001001…
…0000010010000010111
3100202022021012010202201
41133000102002100113
53132404102413421
6114510212345331
710240623255100
oct1370022022027
9322267163681
10102010201111
113a29810aa35
121792b015247
139809119060
144d1a0133a7
1529c0964b91
hex17c0482417

102010201111 has 12 divisors (see below), whose sum is σ = 127792999992. Its totient is φ = 80711367408.

The previous prime is 102010201103. The next prime is 102010201127. The reversal of 102010201111 is 111102010201.

It is not a de Polignac number, because 102010201111 - 23 = 102010201103 is a prime.

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

It is a congruent number.

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

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 80070165 + ... + 80071438.

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

Almost surely, 2102010201111 is an apocalyptic number.

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

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

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

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

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

Adding to 102010201111 its reverse (111102010201), we get a palindrome (213112211312).

It can be divided in two parts, 102010201 and 111, that multiplied together give a palindrome (11323132311).

The spelling of 102010201111 in words is "one hundred two billion, ten million, two hundred one thousand, one hundred eleven".

Divisors: 1 7 13 49 91 637 160141603 1120991221 2081840839 7846938547 14572885873 102010201111