Search a number
-
+
1110100102000 = 2453171671931013
BaseRepresentation
bin10000001001110111000…
…111110100101101110000
310221010100210012002222121
4100021313013310231300
5121141441111231000
62205550053444024
7143126213115031
oct20116707645560
93833323162877
101110100102000
1139887762712a
1215b18a340614
13808b34437a6
143ba2ca46a88
151dd22533b1a
hex102771f4b70

1110100102000 has 320 divisors, whose sum is σ = 2876787373824. Its totient is φ = 412857139200.

The previous prime is 1110100101989. The next prime is 1110100102003. The reversal of 1110100102000 is 2010010111.

It is a congruent number.

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

It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 1095853494 + ... + 1095854506.

Almost surely, 21110100102000 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 1110100102000 its reverse (2010010111), we get a palindrome (1112110112111).

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