Base | Representation |
---|---|
bin | 110100010011000110… |
… | …1100010000000111111 |
3 | 101201220002111212200000 |
4 | 1220212031202000333 |
5 | 3320002404343403 |
6 | 123332234005343 |
7 | 11054103133050 |
oct | 1504615420077 |
9 | 351802455600 |
10 | 112310231103 |
11 | 436a3219a14 |
12 | 19924576853 |
13 | a78b014b65 |
14 | 5615d56727 |
15 | 2dc4d3a7a3 |
hex | 1a2636203f |
112310231103 has 24 divisors (see below), whose sum is σ = 192267723648. Its totient is φ = 64177273944.
The previous prime is 112310231063. The next prime is 112310231107. The reversal of 112310231103 is 301132013211.
112310231103 is a `hidden beast` number, since 112 + 310 + 231 + 10 + 3 = 666.
It is not a de Polignac number, because 112310231103 - 28 = 112310230847 is a prime.
It is a super-2 number, since 2×1123102311032 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112310231107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 33011301 + ... + 33014702.
It is an arithmetic number, because the mean of its divisors is an integer number (8011155152).
Almost surely, 2112310231103 is an apocalyptic number.
112310231103 is a deficient number, since it is larger than the sum of its proper divisors (79957492545).
112310231103 is an frugal number, since it uses more digits than its factorization.
112310231103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66026025 (or 66026013 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 112310231103 its reverse (301132013211), we get a palindrome (413442244314).
The spelling of 112310231103 in words is "one hundred twelve billion, three hundred ten million, two hundred thirty-one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •