Base | Representation |
---|---|
bin | 110100000111010111001110… |
… | …111010001111101101100001 |
3 | 1010001112201121210200110021111 |
4 | 310013113032322033231201 |
5 | 220020241103142014431 |
6 | 2131251014231423321 |
7 | 66164320505120602 |
oct | 6407271672175541 |
9 | 1101481553613244 |
10 | 229204401126241 |
11 | 6703904a0a8a22 |
12 | 21859422224b41 |
13 | 9ab7b614ba278 |
14 | 40857a3377da9 |
15 | 1b771ec1337b1 |
hex | d075cee8fb61 |
229204401126241 has 8 divisors (see below), whose sum is σ = 236956031130368. Its totient is φ = 221475142350000.
The previous prime is 229204401126163. The next prime is 229204401126277. The reversal of 229204401126241 is 142621104402922.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-229204401126241 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 229204401126194 and 229204401126203.
It is not an unprimeable number, because it can be changed into a prime (229204401136241) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5592786135 + ... + 5592827116.
It is an arithmetic number, because the mean of its divisors is an integer number (29619503891296).
Almost surely, 2229204401126241 is an apocalyptic number.
It is an amenable number.
229204401126241 is a deficient number, since it is larger than the sum of its proper divisors (7751630004127).
229204401126241 is a wasteful number, since it uses less digits than its factorization.
229204401126241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11185613943.
The product of its (nonzero) digits is 110592, while the sum is 40.
The spelling of 229204401126241 in words is "two hundred twenty-nine trillion, two hundred four billion, four hundred one million, one hundred twenty-six thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •