Base | Representation |
---|---|
bin | 110100001010011101… |
… | …0110110001001000101 |
3 | 101201010212121201020021 |
4 | 1220110322312021011 |
5 | 3313404122321013 |
6 | 123243351535141 |
7 | 11043651211345 |
oct | 1502472661105 |
9 | 351125551207 |
10 | 112020120133 |
11 | 4356448a289 |
12 | 1986338a4b1 |
13 | a742b9a26c |
14 | 55c95d8d25 |
15 | 2da9631a8d |
hex | 1a14eb6245 |
112020120133 has 8 divisors (see below), whose sum is σ = 112890365280. Its totient is φ = 111152591280.
The previous prime is 112020120131. The next prime is 112020120227. The reversal of 112020120133 is 331021020211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 112020120133 - 21 = 112020120131 is a prime.
It is a super-2 number, since 2×1120201201332 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112020120131) 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 7 ways as a sum of consecutive naturals, for example, 596235 + ... + 761272.
It is an arithmetic number, because the mean of its divisors is an integer number (14111295660).
Almost surely, 2112020120133 is an apocalyptic number.
It is an amenable number.
112020120133 is a deficient number, since it is larger than the sum of its proper divisors (870245147).
112020120133 is a wasteful number, since it uses less digits than its factorization.
112020120133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1358147.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 112020120133 its reverse (331021020211), we get a palindrome (443041140344).
The spelling of 112020120133 in words is "one hundred twelve billion, twenty million, one hundred twenty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •