Base | Representation |
---|---|
bin | 100011100010100000111… |
… | …111100100001111100011 |
3 | 22122110212002000121212121 |
4 | 203202200333210033203 |
5 | 310003203031122321 |
6 | 5105541203205111 |
7 | 341306021145205 |
oct | 43424077441743 |
9 | 8573762017777 |
10 | 2442242442211 |
11 | 86182720a250 |
12 | 3353a6076797 |
13 | 1493c16c6940 |
14 | 862c2d88775 |
15 | 437dd1b0441 |
hex | 238a0fe43e3 |
2442242442211 has 8 divisors (see below), whose sum is σ = 2869207904304. Its totient is φ = 2049434217120.
The previous prime is 2442242442197. The next prime is 2442242442229. The reversal of 2442242442211 is 1122442422442.
2442242442211 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2442242442211 - 225 = 2442208887779 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2442242442251) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8539309096 + ... + 8539309381.
It is an arithmetic number, because the mean of its divisors is an integer number (358650988038).
Almost surely, 22442242442211 is an apocalyptic number.
2442242442211 is a deficient number, since it is larger than the sum of its proper divisors (426965462093).
2442242442211 is a wasteful number, since it uses less digits than its factorization.
2442242442211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17078618501.
The product of its digits is 65536, while the sum is 34.
Adding to 2442242442211 its reverse (1122442422442), we get a palindrome (3564684864653).
The spelling of 2442242442211 in words is "two trillion, four hundred forty-two billion, two hundred forty-two million, four hundred forty-two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •