Search a number
-
+
110002111021000 = 235311171613364691
BaseRepresentation
bin11001000000101111011100…
…110000000111111111001000
3112102111002200020210202112001
4121000233130300013333020
5103404233310410133000
61025542134442200344
732112250600064662
oct3100573460077710
9472432606722461
10110002111021000
11320606a6a16550
12104071904b30b4
13494c20174a803
141d241b8459532
15cab619c0546a
hex640bdcc07fc8

110002111021000 has 256 divisors, whose sum is σ = 297508498110720. Its totient is φ = 37624337920000.

The previous prime is 110002111020937. The next prime is 110002111021003. The reversal of 110002111021000 is 120111200011.

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

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

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

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

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

Almost surely, 2110002111021000 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 110002111021000 its reverse (120111200011), we get a palindrome (110122222221011).

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