Search a number
-
+
1000110111000 = 2335371113379001
BaseRepresentation
bin11101000110110110011…
…01010011100100011000
310112121110101121122101020
432203123031103210120
5112341211142023000
62043235542322440
7132153442452240
oct16433315234430
93477411548336
101000110111000
113561650a2a20
121419b2a29420
137340503c590
1436596d0ab20
151b036266ba0
hexe8db353918

1000110111000 has 1024 divisors, whose sum is σ = 4303261347840. Its totient is φ = 186624000000.

The previous prime is 1000110110999. The next prime is 1000110111043. The reversal of 1000110111000 is 1110110001.

1000110111000 is digitally balanced in base 2 and base 4, because in such bases 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 1000110111000.

It is a congruent number.

It is an unprimeable number.

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

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

Almost surely, 21000110111000 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 1000110111000 its reverse (1110110001), we get a palindrome (1001220221001).

Subtracting from 1000110111000 its reverse (1110110001), we obtain a palindrome (999000000999).

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