Search a number
-
+
1110203130000 = 24354371000183
BaseRepresentation
bin10000001001111101010…
…000110110000010010000
310221010121222001110211110
4100021331100312002100
5121142144000130000
62210004214013320
7143131603621146
oct20117520660220
93833558043743
101110203130000
1139891a7a6638
1215b1b8947240
13808cb8a75c3
143ba3c5c5596
151dd2b5d5850
hex1027d436090

1110203130000 has 200 divisors, whose sum is σ = 3680749133248. Its totient is φ = 288052416000.

The previous prime is 1110203129953. The next prime is 1110203130011. The reversal of 1110203130000 is 313020111.

It is a tau number, because it is divible by the number of its divisors (200).

It is a Harshad number since it is a multiple of its sum of digits (12).

It is an unprimeable number.

It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 609909 + ... + 1610091.

Almost surely, 21110203130000 is an apocalyptic number.

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

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

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

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

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

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

The product of its (nonzero) digits is 18, while the sum is 12.

Adding to 1110203130000 its reverse (313020111), we get a palindrome (1110516150111).

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