Base | Representation |
---|---|
bin | 1010011000010001001011… |
… | …0010011011010001000010 |
3 | 1111101222110220211210121212 |
4 | 2212010102302123101002 |
5 | 2443433331042023432 |
6 | 40134341553450122 |
7 | 2255331033441554 |
oct | 246042262332102 |
9 | 44358426753555 |
10 | 11412043314242 |
11 | 36aa902a3757a |
12 | 1343892270942 |
13 | 64a1c6b8112c |
14 | 2b64badcd4d4 |
15 | 14bcc052c2b2 |
hex | a6112c9b442 |
11412043314242 has 8 divisors (see below), whose sum is σ = 17310402780300. Its totient is φ = 5641909054144.
The previous prime is 11412043314181. The next prime is 11412043314253. The reversal of 11412043314242 is 24241334021411.
It can be written as a sum of positive squares in 2 ways, for example, as 10237830514921 + 1174212799321 = 3199661^2 + 1083611^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×114120433142422 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11412043314199 and 11412043314208.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 32056301267 + ... + 32056301622.
Almost surely, 211412043314242 is an apocalyptic number.
11412043314242 is a deficient number, since it is larger than the sum of its proper divisors (5898359466058).
11412043314242 is an equidigital number, since it uses as much as digits as its factorization.
11412043314242 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64112602980.
The product of its (nonzero) digits is 18432, while the sum is 32.
Adding to 11412043314242 its reverse (24241334021411), we get a palindrome (35653377335653).
The spelling of 11412043314242 in words is "eleven trillion, four hundred twelve billion, forty-three million, three hundred fourteen thousand, two hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •