Base | Representation |
---|---|
bin | 11010010011110101… |
… | …110101010000111010 |
3 | 2200220210200010211200 |
4 | 122103311311100322 |
5 | 430324020310310 |
6 | 20551123035030 |
7 | 2020031310651 |
oct | 322365652072 |
9 | 80823603750 |
10 | 28250166330 |
11 | 10a87534101 |
12 | 5584b0ba76 |
13 | 28829bb069 |
14 | 151dcb0198 |
15 | b051ce9c0 |
hex | 693d7543a |
28250166330 has 96 divisors (see below), whose sum is σ = 78179033088. Its totient is φ = 7053043200.
The previous prime is 28250166293. The next prime is 28250166331. The reversal of 28250166330 is 3366105282.
It is a happy number.
28250166330 is a `hidden beast` number, since 2 + 8 + 2 + 5 + 0 + 16 + 633 + 0 = 666.
It is not an unprimeable number, because it can be changed into a prime (28250166331) by changing a digit.
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 47 ways as a sum of consecutive naturals, for example, 243895 + ... + 340565.
It is an arithmetic number, because the mean of its divisors is an integer number (814364928).
Almost surely, 228250166330 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 28250166330, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (39089516544).
28250166330 is an abundant number, since it is smaller than the sum of its proper divisors (49928866758).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
28250166330 is a wasteful number, since it uses less digits than its factorization.
28250166330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 96892 (or 96889 counting only the distinct ones).
The product of its (nonzero) digits is 51840, while the sum is 36.
The spelling of 28250166330 in words is "twenty-eight billion, two hundred fifty million, one hundred sixty-six thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •