Base | Representation |
---|---|
bin | 10000001100110111001… |
… | …010110100100011010000 |
3 | 10221102200022222020110221 |
4 | 100030313022310203100 |
5 | 121220040430110412 |
6 | 2211241512402424 |
7 | 143302105551550 |
oct | 20146712644320 |
9 | 3842608866427 |
10 | 1113322113232 |
11 | 39a18034392a |
12 | 15b9293a6414 |
13 | 80ca7b1b004 |
14 | 3bc56921160 |
15 | 1de6032db07 |
hex | 103372b48d0 |
1113322113232 has 80 divisors (see below), whose sum is σ = 2468799700992. Its totient is φ = 476444545920.
The previous prime is 1113322113227. The next prime is 1113322113247. The reversal of 1113322113232 is 2323112233111.
It is a super-3 number, since 3×11133221132323 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 1113322113197 and 1113322113206.
It is a congruent number.
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 15 ways as a sum of consecutive naturals, for example, 340359757 + ... + 340363027.
Almost surely, 21113322113232 is an apocalyptic number.
It is an amenable number.
1113322113232 is an abundant number, since it is smaller than the sum of its proper divisors (1355477587760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1113322113232 is a wasteful number, since it uses less digits than its factorization.
1113322113232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6776 (or 6770 counting only the distinct ones).
The product of its digits is 1296, while the sum is 25.
Adding to 1113322113232 its reverse (2323112233111), we get a palindrome (3436434346343).
The spelling of 1113322113232 in words is "one trillion, one hundred thirteen billion, three hundred twenty-two million, one hundred thirteen thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.149 sec. • engine limits •