Base | Representation |
---|---|
bin | 110110111000111000011100… |
… | …100000101100101000001101 |
3 | 1011122201221101201101120111022 |
4 | 312320320130200230220031 |
5 | 223120123141001004204 |
6 | 2213231110132203525 |
7 | 101563551355124141 |
oct | 6670703440545015 |
9 | 1148657351346438 |
10 | 241403410172429 |
11 | 6aa1167a73972a |
12 | 230a97217695a5 |
13 | a491322b084cb |
14 | 4387db75a3221 |
15 | 1cd96cb4d25be |
hex | db8e1c82ca0d |
241403410172429 has 2 divisors, whose sum is σ = 241403410172430. Its totient is φ = 241403410172428.
The previous prime is 241403410172377. The next prime is 241403410172461. The reversal of 241403410172429 is 924271014304142.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 163041487312900 + 78361922859529 = 12768770^2 + 8852227^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-241403410172429 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 241403410172429.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (241403410172489) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 120701705086214 + 120701705086215.
It is an arithmetic number, because the mean of its divisors is an integer number (120701705086215).
Almost surely, 2241403410172429 is an apocalyptic number.
It is an amenable number.
241403410172429 is a deficient number, since it is larger than the sum of its proper divisors (1).
241403410172429 is an equidigital number, since it uses as much as digits as its factorization.
241403410172429 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 387072, while the sum is 44.
The spelling of 241403410172429 in words is "two hundred forty-one trillion, four hundred three billion, four hundred ten million, one hundred seventy-two thousand, four hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •