Search a number
-
+
101101001100000 = 2535511235692341
BaseRepresentation
bin10110111111001101101001…
…010000011100101011100000
3111020222011100121010110001020
4112333031221100130223200
5101222414322240200000
6555005054141205440
730203210025111546
oct2677155120345340
9436864317113036
10101101001100000
112a23976a472440
12b40a074860880
134454a25454c85
141ad7459231d96
15ba4d080bcba0
hex5bf36941cae0

101101001100000 has 1152 divisors, whose sum is σ = 378431268848640. Its totient is φ = 23392512000000.

The previous prime is 101101001099921. The next prime is 101101001100019. The reversal of 101101001100000 is 1100101101.

101101001100000 is digitally balanced in base 4, because in such base it contains all the possibile digits an equal number of times.

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

It is a super Niven number, because it is divisible the sum of any subset of its (nonzero) digits.

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 43187098830 + ... + 43187101170.

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

Almost surely, 2101101001100000 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 101101001100000 its reverse (1100101101), we get a palindrome (101102101201101).

It can be divided in two parts, 101 and 101001100000, that added together give a palindrome (101001100101).

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