Search a number
-
+
101100010100100 = 2235211523211127749
BaseRepresentation
bin10110111111001100101110…
…001100000101010110000100
3111020222001210112101102202020
4112333030232030011112010
5101222410310041200400
6555004411540443140
730203143332544164
oct2677145614052604
9436861715342666
10101100010100100
112a239301036560
12b409a389a94b0
1344548c80494bb
141ad73a37885a4
15ba4c9b0b82a0
hex5bf32e305584

101100010100100 has 288 divisors, whose sum is σ = 319881526272000. Its totient is φ = 24449761728000.

The previous prime is 101100010100083. The next prime is 101100010100119. The reversal of 101100010100100 is 1001010001101.

101100010100100 is digitally balanced in base 3, 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 an unprimeable number.

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

It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 3643361026 + ... + 3643388774.

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

Almost surely, 2101100010100100 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 101100010100100 its reverse (1001010001101), we get a palindrome (102101020101201).

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