Base | Representation |
---|---|
bin | 11001100001001100001101… |
… | …010001111110111110111011 |
3 | 112201101021102222012220100011 |
4 | 121201030031101332332323 |
5 | 104202302130341330021 |
6 | 1034410401453322351 |
7 | 32432331625114003 |
oct | 3141141521767673 |
9 | 481337388186304 |
10 | 112232013230011 |
11 | 32840369649764 |
12 | 107073961963b7 |
13 | 4a81583346c3c |
14 | 1da00b645b003 |
15 | ce962b3b5de1 |
hex | 66130d47efbb |
112232013230011 has 4 divisors (see below), whose sum is σ = 112314476136024. Its totient is φ = 112149550324000.
The previous prime is 112232013229961. The next prime is 112232013230023. The reversal of 112232013230011 is 110032310232211.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-112232013230011 is a prime.
It is a super-2 number, since 2×1122320132300112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (112232013236011) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 41231450965 + ... + 41231453686.
It is an arithmetic number, because the mean of its divisors is an integer number (28078619034006).
Almost surely, 2112232013230011 is an apocalyptic number.
112232013230011 is a deficient number, since it is larger than the sum of its proper divisors (82462906013).
112232013230011 is an equidigital number, since it uses as much as digits as its factorization.
112232013230011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 82462906012.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 112232013230011 its reverse (110032310232211), we get a palindrome (222264323462222).
The spelling of 112232013230011 in words is "one hundred twelve trillion, two hundred thirty-two billion, thirteen million, two hundred thirty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •