Search a number
-
+
2202010110000 = 243654232571
BaseRepresentation
bin100000000010110010000…
…001111100100000110000
321210111202212111201000000
4200002302001330200300
5242034204042010000
64403331154430000
7315042602052051
oct40026201744060
97714685451000
102202010110000
1177995a334418
122b6920892300
1312c85815a53c
14788138dc728
153c42cb60000
hex200b207c830

2202010110000 has 1050 divisors, whose sum is σ = 8370551056868. Its totient is φ = 560688480000.

The previous prime is 2202010109989. The next prime is 2202010110071. The reversal of 2202010110000 is 110102022.

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

It is an unprimeable number.

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

It is a polite number, since it can be written in 209 ways as a sum of consecutive naturals, for example, 3856409715 + ... + 3856410285.

Almost surely, 22202010110000 is an apocalyptic number.

2202010110000 is a gapful number since it is divisible by the number (20) 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 2202010110000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4185275528434).

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

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

2202010110000 is an frugal number, since it uses more digits than its factorization.

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

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

The product of its (nonzero) digits is 8, while the sum is 9.

Adding to 2202010110000 its reverse (110102022), we get a palindrome (2202120212022).

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