Base | Representation |
---|---|
bin | 100011100010101100111… |
… | …010100000011011001010 |
3 | 22122111101000100200121120 |
4 | 203202230322200123022 |
5 | 310004110231124232 |
6 | 5110013110020110 |
7 | 341314000133232 |
oct | 43425472403312 |
9 | 8574330320546 |
10 | 2442442442442 |
11 | 86191a0a23a2 |
12 | 335441047636 |
13 | 149423c81082 |
14 | 8630176acc2 |
15 | 43800a1992c |
hex | 238acea06ca |
2442442442442 has 8 divisors (see below), whose sum is σ = 4884884884896. Its totient is φ = 814147480812.
The previous prime is 2442442442381. The next prime is 2442442442443.
2442442442442 is nontrivially palindromic in base 10.
It is a sphenic number, since it is the product of 3 distinct primes.
2442442442442 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 2442442442394 and 2442442442403.
It is not an unprimeable number, because it can be changed into a prime (2442442442443) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 203536870198 + ... + 203536870209.
It is an arithmetic number, because the mean of its divisors is an integer number (610610610612).
Almost surely, 22442442442442 is an apocalyptic number.
2442442442442 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.
2442442442442 is a wasteful number, since it uses less digits than its factorization.
2442442442442 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 407073740412.
The product of its digits is 2097152, while the sum is 42.
The spelling of 2442442442442 in words is "two trillion, four hundred forty-two billion, four hundred forty-two million, four hundred forty-two thousand, four hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •