Search a number
-
+
110021002000 = 24537131394349
BaseRepresentation
bin110011001110111000…
…0110100001100010000
3101111222112220222200221
41212131300310030100
53300310334031000
6122313135522424
710643265041530
oct1463560641420
9344875828627
10110021002000
1142728a95238
12193a5989414
13a4b4971420
145479ccd4c0
152cddd9561a
hex199dc34310

110021002000 has 320 divisors, whose sum is σ = 329853888000. Its totient is φ = 34561382400.

The previous prime is 110021001997. The next prime is 110021002027. The reversal of 110021002000 is 200120011.

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

It is an unprimeable number.

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

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

Almost surely, 2110021002000 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 110021002000 its reverse (200120011), we get a palindrome (110221122011).

The spelling of 110021002000 in words is "one hundred ten billion, twenty-one million, two thousand".