Base | Representation |
---|---|
bin | 110100010011011011… |
… | …1000111001011001010 |
3 | 101201220212000122210200 |
4 | 1220212313013023022 |
5 | 3320013202144320 |
6 | 123333303353030 |
7 | 11054264601561 |
oct | 1504667071312 |
9 | 351825018720 |
10 | 112321131210 |
11 | 436a9394372 |
12 | 19928152776 |
13 | a790360322 |
14 | 5617592bd8 |
15 | 2dc5c90290 |
hex | 1a26dc72ca |
112321131210 has 48 divisors (see below), whose sum is σ = 292136772096. Its totient is φ = 29941857504.
The previous prime is 112321131161. The next prime is 112321131229. The reversal of 112321131210 is 12131123211.
112321131210 is a `hidden beast` number, since 1 + 1 + 2 + 321 + 131 + 210 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a Curzon 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 23 ways as a sum of consecutive naturals, for example, 43687 + ... + 475973.
It is an arithmetic number, because the mean of its divisors is an integer number (6086182752).
Almost surely, 2112321131210 is an apocalyptic number.
112321131210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
112321131210 is an abundant number, since it is smaller than the sum of its proper divisors (179815640886).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112321131210 is a wasteful number, since it uses less digits than its factorization.
112321131210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 435187 (or 435184 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 18.
Adding to 112321131210 its reverse (12131123211), we get a palindrome (124452254421).
The spelling of 112321131210 in words is "one hundred twelve billion, three hundred twenty-one million, one hundred thirty-one thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •