Base | Representation |
---|---|
bin | 110011111000010100111010… |
… | …001110001001101101011001 |
3 | 1002220212221112021101112120222 |
4 | 303320110322032021231121 |
5 | 214401323420240411223 |
6 | 2125140210214525425 |
7 | 66026550630554435 |
oct | 6370247216115531 |
9 | 1086787467345528 |
10 | 228171114388313 |
11 | 6677a90a733168 |
12 | 21711110666875 |
13 | 9a4159cc3b8c5 |
14 | 404b78019d9c5 |
15 | 1b5a3c34600c8 |
hex | cf853a389b59 |
228171114388313 has 2 divisors, whose sum is σ = 228171114388314. Its totient is φ = 228171114388312.
The previous prime is 228171114388289. The next prime is 228171114388331. The reversal of 228171114388313 is 313883411171822.
Together with next prime (228171114388331) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 227323256481049 + 847857907264 = 15077243^2 + 920792^2 .
It is a cyclic number.
It is not a de Polignac number, because 228171114388313 - 26 = 228171114388249 is a prime.
It is not a weakly prime, because it can be changed into another prime (228171114381313) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 114085557194156 + 114085557194157.
It is an arithmetic number, because the mean of its divisors is an integer number (114085557194157).
Almost surely, 2228171114388313 is an apocalyptic number.
It is an amenable number.
228171114388313 is a deficient number, since it is larger than the sum of its proper divisors (1).
228171114388313 is an equidigital number, since it uses as much as digits as its factorization.
228171114388313 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1548288, while the sum is 53.
The spelling of 228171114388313 in words is "two hundred twenty-eight trillion, one hundred seventy-one billion, one hundred fourteen million, three hundred eighty-eight thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •