Search a number
-
+
101010120111 = 3267167512637
BaseRepresentation
bin101111000010010101…
…1000001110110101111
3100122201120100202112200
41132010223001312233
53123332042320421
6114223045232543
710204060566045
oct1360453016657
9318646322480
10101010120111
113992464130a
12176b0102753
1396a9b81054
144c63284395
152962c69726
hex1784ac1daf

101010120111 has 12 divisors (see below), whose sum is σ = 148081171992. Its totient is φ = 66335003856.

The previous prime is 101010120103. The next prime is 101010120131. The reversal of 101010120111 is 111021010101.

It is not a de Polignac number, because 101010120111 - 23 = 101010120103 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (9).

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (101010120131) 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, 83755716 + ... + 83756921.

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

Almost surely, 2101010120111 is an apocalyptic number.

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

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

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

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

The product of its (nonzero) digits is 2, while the sum is 9.

Adding to 101010120111 its reverse (111021010101), we get a palindrome (212031130212).

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

Divisors: 1 3 9 67 201 603 167512637 502537911 1507613733 11223346679 33670040037 101010120111