Base | Representation |
---|---|
bin | 11001100000101110011010… |
… | …011001011000110111000110 |
3 | 112201021012212101020020201212 |
4 | 121200232122121120313012 |
5 | 104201241120340120402 |
6 | 1034343551133251422 |
7 | 32430120054610001 |
oct | 3140563231306706 |
9 | 481235771206655 |
10 | 112200021020102 |
11 | 328288418a9964 |
12 | 10701148033b72 |
13 | 4a7b555304512 |
14 | 1d9c71d5c4538 |
15 | ce88a7917952 |
hex | 660b9a658dc6 |
112200021020102 has 8 divisors (see below), whose sum is σ = 168495957064200. Its totient is φ = 56034701998704.
The previous prime is 112200021020053. The next prime is 112200021020119. The reversal of 112200021020102 is 201020120002211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1122000210201022 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
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 3 ways as a sum of consecutive naturals, for example, 32654253527 + ... + 32654256962.
It is an arithmetic number, because the mean of its divisors is an integer number (21061994633025).
Almost surely, 2112200021020102 is an apocalyptic number.
112200021020102 is a deficient number, since it is larger than the sum of its proper divisors (56295936044098).
112200021020102 is an equidigital number, since it uses as much as digits as its factorization.
112200021020102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65308511350.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 112200021020102 its reverse (201020120002211), we get a palindrome (313220141022313).
The spelling of 112200021020102 in words is "one hundred twelve trillion, two hundred billion, twenty-one million, twenty thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •