Search a number
-
+
101100011001000 = 23353112519753591
BaseRepresentation
bin10110111111001100101110…
…001111100001010010101000
3111020222001210121002012112220
4112333030232033201102220
5101222410310304013000
6555004412012034040
730203143343315544
oct2677145617412250
9436861717065486
10101100011001000
112a2393015a1400
12b409a39162920
1344548c82a358b
141ad73a3940a24
15ba4c9b1e51a0
hex5bf32e3e14a8

101100011001000 has 384 divisors, whose sum is σ = 346787735374080. Its totient is φ = 24503920320000.

The previous prime is 101100011000971. The next prime is 101100011001007. The reversal of 101100011001000 is 100110001101.

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 101100011001000.

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

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

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

Almost surely, 2101100011001000 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 101100011001000 its reverse (100110001101), we get a palindrome (101200121002101).

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