Base | Representation |
---|---|
bin | 110111000110100010111100… |
… | …111010110011111100101010 |
3 | 1011210001201002211101200210120 |
4 | 313012202330322303330222 |
5 | 223231014220441240432 |
6 | 2215230321422024110 |
7 | 102021442460051262 |
oct | 6706427472637452 |
9 | 1153051084350716 |
10 | 242342404243242 |
11 | 70243922384026 |
12 | 2321b6b8a18036 |
13 | a52ba38111ca4 |
14 | 43bb6137047a2 |
15 | 1d03d37042c2c |
hex | dc68bceb3f2a |
242342404243242 has 8 divisors (see below), whose sum is σ = 484684808486496. Its totient is φ = 80780801414412.
The previous prime is 242342404243217. The next prime is 242342404243297.
242342404243242 is nontrivially palindromic in base 10.
It is a sphenic number, since it is the product of 3 distinct primes.
242342404243242 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 242342404243194 and 242342404243203.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 20195200353598 + ... + 20195200353609.
It is an arithmetic number, because the mean of its divisors is an integer number (60585601060812).
Almost surely, 2242342404243242 is an apocalyptic number.
242342404243242 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
242342404243242 is a wasteful number, since it uses less digits than its factorization.
242342404243242 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 40390400707212.
The product of its (nonzero) digits is 2359296, while the sum is 42.
It can be divided in two parts, 24234240 and 4243242, that added together give a palindrome (28477482).
The spelling of 242342404243242 in words is "two hundred forty-two trillion, three hundred forty-two billion, four hundred four million, two hundred forty-three thousand, two hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •