Base | Representation |
---|---|
bin | 110100110001001101… |
… | …0101011100101011100 |
3 | 101211111111011020222110 |
4 | 1221202122223211130 |
5 | 3324034444424012 |
6 | 124020355314020 |
7 | 11121116515560 |
oct | 1514232534534 |
9 | 354444136873 |
10 | 113320311132 |
11 | 440713a7aa6 |
12 | 19b668ab910 |
13 | a8bc371152 |
14 | 56b01696a0 |
15 | 2e3385d73c |
hex | 1a626ab95c |
113320311132 has 24 divisors (see below), whose sum is σ = 302187496576. Its totient is φ = 32377231728.
The previous prime is 113320311061. The next prime is 113320311161. The reversal of 113320311132 is 231113023311.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 113320311099 and 113320311108.
It is a congruent number.
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 7 ways as a sum of consecutive naturals, for example, 674525578 + ... + 674525745.
Almost surely, 2113320311132 is an apocalyptic number.
113320311132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
113320311132 is an abundant number, since it is smaller than the sum of its proper divisors (188867185444).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113320311132 is a wasteful number, since it uses less digits than its factorization.
113320311132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1349051337 (or 1349051335 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 113320311132 its reverse (231113023311), we get a palindrome (344433334443).
The spelling of 113320311132 in words is "one hundred thirteen billion, three hundred twenty million, three hundred eleven thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •