Base | Representation |
---|---|
bin | 110111001100110001001011… |
… | …100111100100101100110001 |
3 | 1011211120120210201110001110021 |
4 | 313030301023213210230301 |
5 | 223310020430011313431 |
6 | 2220154555353203441 |
7 | 102064360626645451 |
oct | 6714611347445461 |
9 | 1154516721401407 |
10 | 242770000104241 |
11 | 703991a7070215 |
12 | 2328a551a00581 |
13 | a560160a0a85c |
14 | 43d41b88d5d61 |
15 | 1d10011472b11 |
hex | dccc4b9e4b31 |
242770000104241 has 12 divisors (see below), whose sum is σ = 257791762659792. Its totient is φ = 228581633881944.
The previous prime is 242770000104187. The next prime is 242770000104283. The reversal of 242770000104241 is 142401000077242.
It is not a de Polignac number, because 242770000104241 - 235 = 242735640365873 is a prime.
It is a super-2 number, since 2×2427700001042412 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 242770000104197 and 242770000104206.
It is not an unprimeable number, because it can be changed into a prime (242770000104041) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2062803351 + ... + 2062921036.
It is an arithmetic number, because the mean of its divisors is an integer number (21482646888316).
Almost surely, 2242770000104241 is an apocalyptic number.
It is an amenable number.
242770000104241 is a deficient number, since it is larger than the sum of its proper divisors (15021762555551).
242770000104241 is a wasteful number, since it uses less digits than its factorization.
242770000104241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4125724588 (or 4125724569 counting only the distinct ones).
The product of its (nonzero) digits is 25088, while the sum is 34.
The spelling of 242770000104241 in words is "two hundred forty-two trillion, seven hundred seventy billion, one hundred four thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •