Search a number
-
+
100010011101000 = 233537111337900091
BaseRepresentation
bin10110101111010101100101…
…001011111000011101001000
3111010002212022121222011010020
4112233111211023320131020
5101102031000320213000
6552411544223220440
730031325210120520
oct2657254513703510
9433085277864106
10100010011101000
112995900a013570
12b27273a447720
1343a5b9921c150
141a9a720624680
15b86753621ba0
hex5af5652f8748

100010011101000 has 1024 divisors, whose sum is σ = 430274507120640. Its totient is φ = 18664266240000.

The previous prime is 100010011100983. The next prime is 100010011101001. The reversal of 100010011101000 is 101110010001.

100010011101000 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 a self number, because there is not a number n which added to its sum of digits gives 100010011101000.

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

It is a polite number, since it can be written in 255 ways as a sum of consecutive naturals, for example, 110660955 + ... + 111561045.

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

Almost surely, 2100010011101000 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 100010011101000 its reverse (101110010001), we get a palindrome (100111121111001).

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