Base | Representation |
---|---|
bin | 100001101011010011100… |
… | …101100011111101011010 |
3 | 22012020110112001212012002 |
4 | 201223103211203331122 |
5 | 300404032003310232 |
6 | 4531052002521002 |
7 | 326125036340102 |
oct | 41532345437532 |
9 | 8166415055162 |
10 | 2314242244442 |
11 | 812512462137 |
12 | 314623066162 |
13 | 13a302c2a44b |
14 | 8001d326202 |
15 | 402eabc0b62 |
hex | 21ad3963f5a |
2314242244442 has 8 divisors (see below), whose sum is σ = 3518916289716. Its totient is φ = 1141270147872.
The previous prime is 2314242244421. The next prime is 2314242244463. The reversal of 2314242244442 is 2444422424132.
It is an interprime number because it is at equal distance from previous prime (2314242244421) and next prime (2314242244463).
It can be written as a sum of positive squares in 2 ways, for example, as 2314168095121 + 74149321 = 1521239^2 + 8611^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 2314242244396 and 2314242244405.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7925486993 + ... + 7925487284.
Almost surely, 22314242244442 is an apocalyptic number.
2314242244442 is a deficient number, since it is larger than the sum of its proper divisors (1204674045274).
2314242244442 is a wasteful number, since it uses less digits than its factorization.
2314242244442 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15850974352.
The product of its digits is 393216, while the sum is 38.
Adding to 2314242244442 its reverse (2444422424132), we get a palindrome (4758664668574).
The spelling of 2314242244442 in words is "two trillion, three hundred fourteen billion, two hundred forty-two million, two hundred forty-four thousand, four hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •