Base | Representation |
---|---|
bin | 110110110011100111111001… |
… | …010010100011101001011111 |
3 | 1011121110101122100102220021002 |
4 | 312303213321102203221133 |
5 | 223043213100223311312 |
6 | 2212353104014300515 |
7 | 101525466335332604 |
oct | 6663477122435137 |
9 | 1147411570386232 |
10 | 241042042010207 |
11 | 6a8923a0841899 |
12 | 2304b6901b773b |
13 | a466222c6a599 |
14 | 43746d5dc66ab |
15 | 1cd00cb4194c2 |
hex | db39f94a3a5f |
241042042010207 has 2 divisors, whose sum is σ = 241042042010208. Its totient is φ = 241042042010206.
The previous prime is 241042042010191. The next prime is 241042042010249. The reversal of 241042042010207 is 702010240240142.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 241042042010207 - 24 = 241042042010191 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 241042042010207.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (241042042090207) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 120521021005103 + 120521021005104.
It is an arithmetic number, because the mean of its divisors is an integer number (120521021005104).
Almost surely, 2241042042010207 is an apocalyptic number.
241042042010207 is a deficient number, since it is larger than the sum of its proper divisors (1).
241042042010207 is an equidigital number, since it uses as much as digits as its factorization.
241042042010207 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7168, while the sum is 29.
Adding to 241042042010207 its reverse (702010240240142), we get a palindrome (943052282250349).
The spelling of 241042042010207 in words is "two hundred forty-one trillion, forty-two billion, forty-two million, ten thousand, two hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •