Search a number
-
+
2122967000 = 235371179349
BaseRepresentation
bin111111010001001…
…1110011111011000
312110221201220020102
41332202132133120
513321434421000
6550354314532
7103415631110
oct17642363730
95427656212
102122967000
1199a3a5590
124b2b88a48
1327aa9c8bb
14161d48040
15c65a23d5
hex7e89e7d8

2122967000 has 256 divisors, whose sum is σ = 6289920000. Its totient is φ = 651456000.

The previous prime is 2122966961. The next prime is 2122967023. The reversal of 2122967000 is 7692212.

It is a congruent number.

It is an unprimeable number.

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

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

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

Almost surely, 22122967000 is an apocalyptic number.

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

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

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

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

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

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

The product of its (nonzero) digits is 3024, while the sum is 29.

The square root of 2122967000 is about 46075.6660288270. Note that the first 3 decimals coincide. The cubic root of 2122967000 is about 1285.2306711414.

The spelling of 2122967000 in words is "two billion, one hundred twenty-two million, nine hundred sixty-seven thousand".