Base | Representation |
---|---|
bin | 11011001100101… |
… | …11011111011101 |
3 | 120220022210201222 |
4 | 31212113133131 |
5 | 431402132001 |
6 | 34350143125 |
7 | 5440224611 |
oct | 1546273735 |
9 | 526283658 |
10 | 228161501 |
11 | 107878127 |
12 | 644b1aa5 |
13 | 38367509 |
14 | 22433341 |
15 | 1506d61b |
hex | d9977dd |
228161501 has 2 divisors, whose sum is σ = 228161502. Its totient is φ = 228161500.
The previous prime is 228161497. The next prime is 228161503. The reversal of 228161501 is 105161822.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 221265625 + 6895876 = 14875^2 + 2626^2 .
It is a cyclic number.
It is not a de Polignac number, because 228161501 - 22 = 228161497 is a prime.
Together with 228161503, it forms a pair of twin primes.
It is a Chen prime.
It is equal to p12547016 and since 228161501 and 12547016 have the same sum of digits, it is a Honaker prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (228161503) 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 as a sum of consecutive naturals, namely, 114080750 + 114080751.
It is an arithmetic number, because the mean of its divisors is an integer number (114080751).
Almost surely, 2228161501 is an apocalyptic number.
It is an amenable number.
228161501 is a deficient number, since it is larger than the sum of its proper divisors (1).
228161501 is an equidigital number, since it uses as much as digits as its factorization.
228161501 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 960, while the sum is 26.
The square root of 228161501 is about 15105.0157563638. The cubic root of 228161501 is about 611.0556842647.
The spelling of 228161501 in words is "two hundred twenty-eight million, one hundred sixty-one thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •