Base | Representation |
---|---|
bin | 110100010110001011… |
… | …0110101011010001100 |
3 | 101202011021112000001200 |
4 | 1220230112311122030 |
5 | 3320210303130012 |
6 | 123350355505500 |
7 | 11056464365052 |
oct | 1505426653214 |
9 | 352137460050 |
10 | 112413333132 |
11 | 4374643a001 |
12 | 19952bb8290 |
13 | a7a64a3589 |
14 | 56259141d2 |
15 | 2dcde043dc |
hex | 1a2c5b568c |
112413333132 has 36 divisors (see below), whose sum is σ = 285502655256. Its totient is φ = 37293520320.
The previous prime is 112413333127. The next prime is 112413333167. The reversal of 112413333132 is 231333314211.
112413333132 is a `hidden beast` number, since 1 + 12 + 4 + 1 + 333 + 313 + 2 = 666.
It is a tau number, because it is divible by the number of its divisors (36).
It is a nude number because it is divisible by every one of its digits.
It is a junction number, because it is equal to n+sod(n) for n = 112413333096 and 112413333105.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 7391913 + ... + 7407104.
Almost surely, 2112413333132 is an apocalyptic number.
112413333132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
112413333132 is an abundant number, since it is smaller than the sum of its proper divisors (173089322124).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112413333132 is a wasteful number, since it uses less digits than its factorization.
112413333132 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14799238 (or 14799233 counting only the distinct ones).
The product of its digits is 3888, while the sum is 27.
Adding to 112413333132 its reverse (231333314211), we get a palindrome (343746647343).
The spelling of 112413333132 in words is "one hundred twelve billion, four hundred thirteen million, three hundred thirty-three thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •