Base | Representation |
---|---|
bin | 1100001111111… |
… | …11001101101100 |
3 | 21011100121102021 |
4 | 12013333031230 |
5 | 202301212403 |
6 | 14110235524 |
7 | 2355264520 |
oct | 607771554 |
9 | 234317367 |
10 | 102757228 |
11 | 53005032 |
12 | 2a4b5ba4 |
13 | 1839a7c2 |
14 | d90bd80 |
15 | 904b8bd |
hex | 61ff36c |
102757228 has 48 divisors (see below), whose sum is σ = 212050944. Its totient is φ = 42658560.
The previous prime is 102757223. The next prime is 102757247. The reversal of 102757228 is 822757201.
It is a junction number, because it is equal to n+sod(n) for n = 102757193 and 102757202.
It is not an unprimeable number, because it can be changed into a prime (102757223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 148363 + ... + 149053.
It is an arithmetic number, because the mean of its divisors is an integer number (4417728).
Almost surely, 2102757228 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 102757228, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (106025472).
102757228 is an abundant number, since it is smaller than the sum of its proper divisors (109293716).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102757228 is a wasteful number, since it uses less digits than its factorization.
102757228 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 862 (or 860 counting only the distinct ones).
The product of its (nonzero) digits is 15680, while the sum is 34.
The square root of 102757228 is about 10136.9239910340. The cubic root of 102757228 is about 468.3862384844.
The spelling of 102757228 in words is "one hundred two million, seven hundred fifty-seven thousand, two hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •