Base | Representation |
---|---|
bin | 100011100010101101000… |
… | …010000011110010100111 |
3 | 22122111101011002021111001 |
4 | 203202231002003302213 |
5 | 310004111233003221 |
6 | 5110013220254131 |
7 | 341314023020365 |
oct | 43425502036247 |
9 | 8574334067431 |
10 | 2442444422311 |
11 | 861920224953 |
12 | 335441841347 |
13 | 1494244c52aa |
14 | 86301b24635 |
15 | 43800cab391 |
hex | 238ad083ca7 |
2442444422311 has 16 divisors (see below), whose sum is σ = 2585665843200. Its totient is φ = 2303166444768.
The previous prime is 2442444422261. The next prime is 2442444422323. The reversal of 2442444422311 is 1132244442442.
It is a cyclic number.
It is not a de Polignac number, because 2442444422311 - 27 = 2442444422183 is a prime.
It is a super-2 number, since 2×24424444223112 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2442444422371) 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 15 ways as a sum of consecutive naturals, for example, 14289210 + ... + 14459128.
It is an arithmetic number, because the mean of its divisors is an integer number (161604115200).
Almost surely, 22442444422311 is an apocalyptic number.
2442444422311 is a deficient number, since it is larger than the sum of its proper divisors (143221420889).
2442444422311 is a wasteful number, since it uses less digits than its factorization.
2442444422311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 181518.
The product of its digits is 196608, while the sum is 37.
Adding to 2442444422311 its reverse (1132244442442), we get a palindrome (3574688864753).
The spelling of 2442444422311 in words is "two trillion, four hundred forty-two billion, four hundred forty-four million, four hundred twenty-two thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •