Base | Representation |
---|---|
bin | 110100110001100000… |
… | …0110111011011101100 |
3 | 101211112011222211010012 |
4 | 1221203000313123230 |
5 | 3324100030234012 |
6 | 124021354032352 |
7 | 11121300556340 |
oct | 1514300673354 |
9 | 354464884105 |
10 | 113330321132 |
11 | 44077014726 |
12 | 19b6a1186b8 |
13 | a8c1467422 |
14 | 56b1613620 |
15 | 2e34689622 |
hex | 1a630376ec |
113330321132 has 48 divisors (see below), whose sum is σ = 235509845760. Its totient is φ = 46688642112.
The previous prime is 113330321123. The next prime is 113330321179. The reversal of 113330321132 is 231123033311.
It is a super-3 number, since 3×1133303211323 (a number of 34 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 = 113330321098 and 113330321107.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 123098 + ... + 491745.
It is an arithmetic number, because the mean of its divisors is an integer number (4906455120).
Almost surely, 2113330321132 is an apocalyptic number.
It is an amenable number.
113330321132 is an abundant number, since it is smaller than the sum of its proper divisors (122179524628).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113330321132 is a wasteful number, since it uses less digits than its factorization.
113330321132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 615110 (or 615108 counting only the distinct ones).
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 113330321132 its reverse (231123033311), we get a palindrome (344453354443).
The spelling of 113330321132 in words is "one hundred thirteen billion, three hundred thirty million, three hundred twenty-one thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •