Search a number
-
+
101001101110000 = 2454713293827249
BaseRepresentation
bin10110111101110000100110…
…110000001110101011110000
3111020121121111101200010201121
4112331300212300032223300
5101214300223341010000
6554451133145512024
730163042304156440
oct2675604660165360
9436547441603647
10101001101110000
112a200365535333
12b3b28344a2614
134448494590760
141ad269d5a6120
15ba240ca3ab1a
hex5bdc26c0eaf0

101001101110000 has 400 divisors, whose sum is σ = 311342807160000. Its totient is φ = 30862927872000.

The previous prime is 101001101109959. The next prime is 101001101110001. The reversal of 101001101110000 is 11101100101.

It is a happy number.

It is a tau number, because it is divible by the number of its divisors (400).

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

It is a congruent number.

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

It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 24476376 + ... + 28303624.

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

Almost surely, 2101001101110000 is an apocalyptic number.

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

It is an amenable number.

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

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

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

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

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

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

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

Adding to 101001101110000 its reverse (11101100101), we get a palindrome (101012202210101).

It can be divided in two parts, 101001101 and 110000, that added together give a palindrome (101111101).

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