Search a number
-
+
101111100011010 = 232537449353319141
BaseRepresentation
bin10110111111010111000011…
…001100101111001000000010
3111021000010102102000021120100
4112333113003030233020002
5101223101013100323020
6555013444220023230
730204015213332025
oct2677270314571002
9437003372007510
10101111100011010
112a242a81aa4791
12b410012991b16
13445597479436b
141ad7b365811bc
15ba51e99b7a90
hex5bf5c332f202

101111100011010 has 192 divisors, whose sum is σ = 270686018959200. Its totient is φ = 26167027138560.

The previous prime is 101111100011003. The next prime is 101111100011017. The reversal of 101111100011010 is 10110001111101.

It is an interprime number because it is at equal distance from previous prime (101111100011003) and next prime (101111100011017).

It can be written as a sum of positive squares in 16 ways, for example, as 52078348540089 + 49032751470921 = 7216533^2 + 7002339^2 .

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 = 101111100010983 and 101111100011001.

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

Almost surely, 2101111100011010 is an apocalyptic number.

101111100011010 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 101111100011010, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (135343009479600).

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

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

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

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

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

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

Adding to 101111100011010 its reverse (10110001111101), we get a palindrome (111221101122111).

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