Base | Representation |
---|---|
bin | 11011001100101… |
… | …00110001000001 |
3 | 120220022020102111 |
4 | 31212110301001 |
5 | 431401302322 |
6 | 34350015321 |
7 | 5440150222 |
oct | 1546246101 |
9 | 526266374 |
10 | 228150337 |
11 | 10786a7a8 |
12 | 644a7541 |
13 | 383623cc |
14 | 2242d249 |
15 | 1506a177 |
hex | d994c41 |
228150337 has 4 divisors (see below), whose sum is σ = 236017620. Its totient is φ = 220283056.
The previous prime is 228150313. The next prime is 228150379. The reversal of 228150337 is 733051822.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 733051822 = 2 ⋅366525911.
It can be written as a sum of positive squares in 2 ways, for example, as 127328656 + 100821681 = 11284^2 + 10041^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-228150337 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 228150299 and 228150308.
It is not an unprimeable number, because it can be changed into a prime (228150397) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3933598 + ... + 3933655.
It is an arithmetic number, because the mean of its divisors is an integer number (59004405).
Almost surely, 2228150337 is an apocalyptic number.
It is an amenable number.
228150337 is a deficient number, since it is larger than the sum of its proper divisors (7867283).
228150337 is an equidigital number, since it uses as much as digits as its factorization.
228150337 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7867282.
The product of its (nonzero) digits is 10080, while the sum is 31.
The square root of 228150337 is about 15104.6462057209. The cubic root of 228150337 is about 611.0457177324.
The spelling of 228150337 in words is "two hundred twenty-eight million, one hundred fifty thousand, three hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •