Base | Representation |
---|---|
bin | 1010000110101100101110… |
… | …1110001110111100010100 |
3 | 1110100010101011122111012211 |
4 | 2201223023232032330110 |
5 | 2424012144022302012 |
6 | 35343542411123204 |
7 | 2224454124025555 |
oct | 241531356167424 |
9 | 43303334574184 |
10 | 11110203322132 |
11 | 35a38a1150a42 |
12 | 12b5294743504 |
13 | 6278c2a9c3c5 |
14 | 2a5a4576432c |
15 | 1440065656a7 |
hex | a1acbb8ef14 |
11110203322132 has 6 divisors (see below), whose sum is σ = 19442855813738. Its totient is φ = 5555101661064.
The previous prime is 11110203322093. The next prime is 11110203322139. The reversal of 11110203322132 is 23122330201111.
It can be written as a sum of positive squares in only one way, i.e., 10977055690896 + 133147631236 = 3313164^2 + 364894^2 .
It is a super-2 number, since 2×111102033221322 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11110203322139) by changing a digit.
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 as a sum of consecutive naturals, namely, 1388775415263 + ... + 1388775415270.
Almost surely, 211110203322132 is an apocalyptic number.
It is an amenable number.
11110203322132 is a deficient number, since it is larger than the sum of its proper divisors (8332652491606).
11110203322132 is a wasteful number, since it uses less digits than its factorization.
11110203322132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2777550830537 (or 2777550830535 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 11110203322132 its reverse (23122330201111), we get a palindrome (34232533523243).
The spelling of 11110203322132 in words is "eleven trillion, one hundred ten billion, two hundred three million, three hundred twenty-two thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •