Search a number
-
+
101101101220000 = 25547247671812
BaseRepresentation
bin10110111111001101101111…
…001110011000000010100000
3111020222011121120112001212101
4112333031233032120002200
5101222420023403020000
6555005112115140144
730203212352113600
oct2677155716300240
9436864546461771
10101101101220000
112a239810a36042
12b40a0a22a4654
134454a4010b28b
141ad7468654c00
15ba4d11c97e6a
hex5bf36f3980a0

101101101220000 has 1080 divisors, whose sum is σ = 301564166726592. Its totient is φ = 33234727680000.

The previous prime is 101101101219997. The next prime is 101101101220027. The reversal of 101101101220000 is 22101101101.

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

It is an unprimeable number.

It is a polite number, since it can be written in 179 ways as a sum of consecutive naturals, for example, 558569619910 + ... + 558569620090.

Almost surely, 2101101101220000 is an apocalyptic number.

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

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

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

101101101220000 is an frugal number, since it uses more digits than its factorization.

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

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

The product of its (nonzero) digits is 4, while the sum is 10.

Adding to 101101101220000 its reverse (22101101101), we get a palindrome (101123202321101).

The spelling of 101101101220000 in words is "one hundred one trillion, one hundred one billion, one hundred one million, two hundred twenty thousand".