Base | Representation |
---|---|
bin | 110100001100011000001000… |
… | …111001110111111000111101 |
3 | 1010002202200000111121121011101 |
4 | 310030120020321313320331 |
5 | 220041412243200202002 |
6 | 2132113201450253101 |
7 | 66231236334650263 |
oct | 6414301071677075 |
9 | 1102680014547141 |
10 | 229548971490877 |
11 | 67161199093915 |
12 | 218b4166127191 |
13 | 9b114b52106ac |
14 | 409832da6c433 |
15 | 1b81167666587 |
hex | d0c608e77e3d |
229548971490877 has 2 divisors, whose sum is σ = 229548971490878. Its totient is φ = 229548971490876.
The previous prime is 229548971490677. The next prime is 229548971490887. The reversal of 229548971490877 is 778094179845922.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 210702033705241 + 18846937785636 = 14515579^2 + 4341306^2 .
It is a cyclic number.
It is not a de Polignac number, because 229548971490877 - 215 = 229548971458109 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 229548971490877.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (229548971490887) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 114774485745438 + 114774485745439.
It is an arithmetic number, because the mean of its divisors is an integer number (114774485745439).
Almost surely, 2229548971490877 is an apocalyptic number.
It is an amenable number.
229548971490877 is a deficient number, since it is larger than the sum of its proper divisors (1).
229548971490877 is an equidigital number, since it uses as much as digits as its factorization.
229548971490877 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5120962560, while the sum is 82.
The spelling of 229548971490877 in words is "two hundred twenty-nine trillion, five hundred forty-eight billion, nine hundred seventy-one million, four hundred ninety thousand, eight hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •