Search a number
-
+
101001010111110 = 23253749988168993
BaseRepresentation
bin10110111101110000100001…
…010101000110001010000110
3111020121121021001102220201100
4112331300201111012022012
5101214300032042023420
6554451120135240530
730163040120533524
oct2675604125061206
9436547231386640
10101001010111110
112a20031913153a
12b3b2809b19146
13444847b77bc65
141ad2691479314
15ba2404a63190
hex5bdc21546286

101001010111110 has 192 divisors, whose sum is σ = 270551139768000. Its totient is φ = 26123086725120.

The previous prime is 101001010111109. The next prime is 101001010111117. The reversal of 101001010111110 is 11111010100101.

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 = 101001010111092 and 101001010111101.

It is a congruent number.

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

It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 1463896774 + ... + 1463965766.

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

Almost surely, 2101001010111110 is an apocalyptic number.

101001010111110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

It is a practical number, because each smaller number is the sum of distinct divisors of 101001010111110, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (135275569884000).

101001010111110 is an abundant number, since it is smaller than the sum of its proper divisors (169550129656890).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

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

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

Adding to 101001010111110 its reverse (11111010100101), we get a palindrome (112112020211211).

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