Base | Representation |
---|---|
bin | 10101010100000001… |
… | …00010001000100011 |
3 | 1002112102112001010210 |
4 | 22222000202020203 |
5 | 141413200413443 |
6 | 5131222025203 |
7 | 553356050643 |
oct | 125200421043 |
9 | 32472461123 |
10 | 11442201123 |
11 | 4941908071 |
12 | 2273b78203 |
13 | 1104723612 |
14 | 7a78dc523 |
15 | 46e7dbc33 |
hex | 2aa022223 |
11442201123 has 8 divisors (see below), whose sum is σ = 15668599888. Its totient is φ = 7421968224.
The previous prime is 11442201077. The next prime is 11442201149. The reversal of 11442201123 is 32110224411.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11442201123 - 26 = 11442201059 is a prime.
It is a super-2 number, since 2×114422011232 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11442201123.
It is not an unprimeable number, because it can be changed into a prime (11442201163) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 51541336 + ... + 51541557.
It is an arithmetic number, because the mean of its divisors is an integer number (1958574986).
Almost surely, 211442201123 is an apocalyptic number.
11442201123 is a deficient number, since it is larger than the sum of its proper divisors (4226398765).
11442201123 is a wasteful number, since it uses less digits than its factorization.
11442201123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 103082933.
The product of its (nonzero) digits is 384, while the sum is 21.
Adding to 11442201123 its reverse (32110224411), we get a palindrome (43552425534).
The spelling of 11442201123 in words is "eleven billion, four hundred forty-two million, two hundred one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •