Base | Representation |
---|---|
bin | 11001011110010010001110… |
… | …101001100111100001010001 |
3 | 112200200012000000121002111001 |
4 | 121132102032221213201101 |
5 | 104141014142434121223 |
6 | 1034134534251222001 |
7 | 32412032222424130 |
oct | 3136221651474121 |
9 | 480605000532431 |
10 | 112032320223313 |
11 | 327737050a9136 |
12 | 10694745447901 |
13 | 4a687aa803a09 |
14 | 1d9457104d917 |
15 | ce433ed829ad |
hex | 65e48ea67851 |
112032320223313 has 32 divisors (see below), whose sum is σ = 132684785925120. Its totient is φ = 92606025919680.
The previous prime is 112032320223283. The next prime is 112032320223337. The reversal of 112032320223313 is 313322023230211.
It is a happy number.
It is not a de Polignac number, because 112032320223313 - 25 = 112032320223281 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (112032320223613) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 556678 + ... + 14979136.
It is an arithmetic number, because the mean of its divisors is an integer number (4146399560160).
Almost surely, 2112032320223313 is an apocalyptic number.
It is an amenable number.
112032320223313 is a deficient number, since it is larger than the sum of its proper divisors (20652465701807).
112032320223313 is a wasteful number, since it uses less digits than its factorization.
112032320223313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14422837.
The product of its (nonzero) digits is 7776, while the sum is 28.
Adding to 112032320223313 its reverse (313322023230211), we get a palindrome (425354343453524).
The spelling of 112032320223313 in words is "one hundred twelve trillion, thirty-two billion, three hundred twenty million, two hundred twenty-three thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •