Base | Representation |
---|---|
bin | 111111110110101… |
… | …1000111110010000 |
3 | 12112022200121210011 |
4 | 1333231120332100 |
5 | 13342001331300 |
6 | 552335244304 |
7 | 104044562251 |
oct | 17755307620 |
9 | 5468617704 |
10 | 2142605200 |
11 | 9aa498aaa |
12 | 4b9679694 |
13 | 281b87438 |
14 | 1647bab28 |
15 | c8180eba |
hex | 7fb58f90 |
2142605200 has 120 divisors (see below), whose sum is σ = 5470042752. Its totient is φ = 803727360.
The previous prime is 2142605177. The next prime is 2142605221. The reversal of 2142605200 is 25062412.
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 23 ways as a sum of consecutive naturals, for example, 3311277 + ... + 3311923.
Almost surely, 22142605200 is an apocalyptic number.
2142605200 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 2142605200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2735021376).
2142605200 is an abundant number, since it is smaller than the sum of its proper divisors (3327437552).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2142605200 is a wasteful number, since it uses less digits than its factorization.
2142605200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1169 (or 1158 counting only the distinct ones).
The product of its (nonzero) digits is 960, while the sum is 22.
The square root of 2142605200 is about 46288.2836147550. The cubic root of 2142605200 is about 1289.1814609748.
Adding to 2142605200 its reverse (25062412), we get a palindrome (2167667612).
The spelling of 2142605200 in words is "two billion, one hundred forty-two million, six hundred five thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •