Base | Representation |
---|---|
bin | 110100100111111111… |
… | …1100110001010001100 |
3 | 101210200221112212012200 |
4 | 1221033333212022030 |
5 | 3322421333034012 |
6 | 123525554401500 |
7 | 11110344346545 |
oct | 1511777461214 |
9 | 353627485180 |
10 | 113011221132 |
11 | 43a22985117 |
12 | 19a9b290290 |
13 | a87030ca64 |
14 | 56810ab4cc |
15 | 2e166563dc |
hex | 1a4ffe628c |
113011221132 has 18 divisors (see below), whose sum is σ = 285667253508. Its totient is φ = 37670407032.
The previous prime is 113011221121. The next prime is 113011221151. The reversal of 113011221132 is 231122110311.
113011221132 is a `hidden beast` number, since 11 + 301 + 1 + 221 + 132 = 666.
It is a tau number, because it is divible by the number of its divisors (18).
It is a super-2 number, since 2×1130112211322 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1569600258 + ... + 1569600329.
Almost surely, 2113011221132 is an apocalyptic number.
113011221132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
113011221132 is an abundant number, since it is smaller than the sum of its proper divisors (172656032376).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113011221132 is a wasteful number, since it uses less digits than its factorization.
113011221132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3139200597 (or 3139200592 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 18.
Adding to 113011221132 its reverse (231122110311), we get a palindrome (344133331443).
The spelling of 113011221132 in words is "one hundred thirteen billion, eleven million, two hundred twenty-one thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •