Base | Representation |
---|---|
bin | 11001100010001110100001… |
… | …101111001111011001001000 |
3 | 112201122002020201201112222110 |
4 | 121202032201233033121020 |
5 | 104204434000142412404 |
6 | 1034503215534422320 |
7 | 32440432365445005 |
oct | 3142164157173110 |
9 | 481562221645873 |
10 | 112303223404104 |
11 | 32868590966507 |
12 | 1071914a3619a0 |
13 | 4a881c1408925 |
14 | 1da370da908ac |
15 | ceb3e7d71b89 |
hex | 6623a1bcf648 |
112303223404104 has 32 divisors (see below), whose sum is σ = 281825579661120. Its totient is φ = 37292071647936.
The previous prime is 112303223404081. The next prime is 112303223404181. The reversal of 112303223404104 is 401404322303211.
It is a super-2 number, since 2×1123032234041042 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8896003147 + ... + 8896015770.
It is an arithmetic number, because the mean of its divisors is an integer number (8807049364410).
Almost surely, 2112303223404104 is an apocalyptic number.
It is an amenable number.
112303223404104 is an abundant number, since it is smaller than the sum of its proper divisors (169522356257016).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112303223404104 is a wasteful number, since it uses less digits than its factorization.
112303223404104 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17792019189 (or 17792019185 counting only the distinct ones).
The product of its (nonzero) digits is 13824, while the sum is 30.
Adding to 112303223404104 its reverse (401404322303211), we get a palindrome (513707545707315).
The spelling of 112303223404104 in words is "one hundred twelve trillion, three hundred three billion, two hundred twenty-three million, four hundred four thousand, one hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •