Search a number
BaseRepresentation
bin10110111111010110111101…
…110101011000000001101000
3111021000010012010122022001021
4112333112331311120001220
5101223100322030013000
6555013431242502224
730204013041265126
oct2677267565300150
9437003163568037
10101111010001000
112a242a3620694a
12b40bba8804974
13445595bc3a9bc
15ba51e1b3811a
hex5bf5bdd58068

101111010001000 has 128 divisors (see below), whose sum is σ = 242314180542720. Its totient is φ = 39477703200000.

The previous prime is 101111010000991. The next prime is 101111010001081. The reversal of 101111010001000 is 100010111101.

Adding to 101111010001000 its reverse (100010111101), we get a palindrome (101211020112101).

It is a happy number.

It is an unprimeable number.

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1664445 + ... + 14317555.

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

Almost surely, 2101111010001000 is an apocalyptic number.

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

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

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

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

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

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

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

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