Base | Representation |
---|---|
bin | 1010001110011000111111… |
… | …0100110100011111011011 |
3 | 1110210202110011122020210100 |
4 | 2203212033310310133123 |
5 | 2433143304123331021 |
6 | 35524354422150443 |
7 | 2240142503463450 |
oct | 243461764643733 |
9 | 43722404566710 |
10 | 11242342402011 |
11 | 364493a220486 |
12 | 1316a11882423 |
13 | 6371c0b95876 |
14 | 2ac1bcd6d827 |
15 | 14768c0b0626 |
hex | a398fd347db |
11242342402011 has 48 divisors (see below), whose sum is σ = 18596997619200. Its totient is φ = 6410979287424.
The previous prime is 11242342402003. The next prime is 11242342402037. The reversal of 11242342402011 is 11020424324211.
11242342402011 is a `hidden beast` number, since 1 + 1 + 24 + 234 + 2 + 402 + 0 + 1 + 1 = 666.
It is not a de Polignac number, because 11242342402011 - 23 = 11242342402003 is a prime.
It is a super-2 number, since 2×112423424020112 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (11242342403011) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 80596335 + ... + 80735703.
It is an arithmetic number, because the mean of its divisors is an integer number (387437450400).
Almost surely, 211242342402011 is an apocalyptic number.
11242342402011 is a deficient number, since it is larger than the sum of its proper divisors (7354655217189).
11242342402011 is a wasteful number, since it uses less digits than its factorization.
11242342402011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 142008 (or 142005 counting only the distinct ones).
The product of its (nonzero) digits is 3072, while the sum is 27.
Adding to 11242342402011 its reverse (11020424324211), we get a palindrome (22262766726222).
The spelling of 11242342402011 in words is "eleven trillion, two hundred forty-two billion, three hundred forty-two million, four hundred two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •