Base | Representation |
---|---|
bin | 1000000100111010… |
… | …0001000011001010 |
3 | 12121002121011210000 |
4 | 2001032201003022 |
5 | 13420011110000 |
6 | 555045103430 |
7 | 104504154600 |
oct | 20116410312 |
9 | 5532534700 |
10 | 2168066250 |
11 | a128a9299 |
12 | 5060b7b76 |
13 | 28723044c |
14 | 167d27870 |
15 | ca510000 |
hex | 813a10ca |
2168066250 has 600 divisors, whose sum is σ = 7756642080. Its totient is φ = 449064000.
The previous prime is 2168066239. The next prime is 2168066267. The reversal of 2168066250 is 526608612.
2168066250 is a `hidden beast` number, since 21 + 6 + 8 + 0 + 6 + 625 + 0 = 666.
It is a super-2 number, since 2×21680662502 = 9401022528778125000, which contains 22 as substring.
It is a nialpdrome in base 15.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 299 ways as a sum of consecutive naturals, for example, 94263739 + ... + 94263761.
Almost surely, 22168066250 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2168066250, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3878321040).
2168066250 is an abundant number, since it is smaller than the sum of its proper divisors (5588575830).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2168066250 is a wasteful number, since it uses less digits than its factorization.
2168066250 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 90 (or 59 counting only the distinct ones).
The product of its (nonzero) digits is 34560, while the sum is 36.
The square root of 2168066250 is about 46562.4983221476. The cubic root of 2168066250 is about 1294.2679085874.
The spelling of 2168066250 in words is "two billion, one hundred sixty-eight million, sixty-six thousand, two hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •