Search a number
-
+
101011101110010 = 2325713371312579901
BaseRepresentation
bin10110111101111001111010…
…110011001100111011111010
3111020122120022022102202212100
4112331321322303030323322
5101214431213341010020
6554455505332324230
730163545151601430
oct2675717263147372
9436576268382770
10101011101110010
112a20462724a353
12b3b4765473676
1344493c927ac20
141ad2d6b728d50
15ba27e58e8a90
hex5bde7acccefa

101011101110010 has 768 divisors, whose sum is σ = 335841248590848. Its totient is φ = 20495794176000.

The previous prime is 101011101109991. The next prime is 101011101110041. The reversal of 101011101110010 is 10011101110101.

It is a super-3 number, since 3×1010111011100103 (a number of 43 digits) contains 333 as substring.

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 = 101011101109974 and 101011101110001.

It is an unprimeable number.

It is a pernicious number, because its binary representation contains a prime number (31) of ones.

It is a polite number, since it can be written in 383 ways as a sum of consecutive naturals, for example, 10202106060 + ... + 10202115960.

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

Almost surely, 2101011101110010 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 101011101110010 its reverse (10011101110101), we get a palindrome (111022202220111).

Subtracting from 101011101110010 its reverse (10011101110101), we obtain a palindrome (90999999999909).

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