Base | Representation |
---|---|
bin | 101101001000100… |
… | …110101010010100 |
3 | 1221202212021121000 |
4 | 231020212222110 |
5 | 3022322331403 |
6 | 203050023300 |
7 | 24523231206 |
oct | 5510465224 |
9 | 1852767530 |
10 | 757230228 |
11 | 359489307 |
12 | 191717b30 |
13 | c0b59731 |
14 | 727d4776 |
15 | 467297a3 |
hex | 2d226a94 |
757230228 has 48 divisors (see below), whose sum is σ = 1965539520. Its totient is φ = 252108000.
The previous prime is 757230217. The next prime is 757230233. The reversal of 757230228 is 822032757.
It is a happy number.
It is a hoax number, since the sum of its digits (36) coincides with the sum of the digits of its distinct prime factors.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 757230192 and 757230201.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 97903 + ... + 105353.
It is an arithmetic number, because the mean of its divisors is an integer number (40948740).
Almost surely, 2757230228 is an apocalyptic number.
It is an amenable number.
757230228 is an abundant number, since it is smaller than the sum of its proper divisors (1208309292).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
757230228 is a wasteful number, since it uses less digits than its factorization.
757230228 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8405 (or 8397 counting only the distinct ones).
The product of its (nonzero) digits is 47040, while the sum is 36.
The square root of 757230228 is about 27517.8165558243. The cubic root of 757230228 is about 911.4705635546.
The spelling of 757230228 in words is "seven hundred fifty-seven million, two hundred thirty thousand, two hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •