Base | Representation |
---|---|
bin | 11001100000101110100101… |
… | …101110111010011011100001 |
3 | 112201021020100122002222222021 |
4 | 121200232211232322123201 |
5 | 104201242013032241001 |
6 | 1034344022045541441 |
7 | 32430124554324223 |
oct | 3140564556723341 |
9 | 481236318088867 |
10 | 112200211212001 |
11 | 3282892a1a2950 |
12 | 1070119b874881 |
13 | 4a7b5858363c3 |
14 | 1d9c73a972413 |
15 | ce88b9485ba1 |
hex | 660ba5bba6e1 |
112200211212001 has 8 divisors (see below), whose sum is σ = 122404663768608. Its totient is φ = 101996497548000.
The previous prime is 112200211211989. The next prime is 112200211212053. The reversal of 112200211212001 is 100212112002211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 112200211212001 - 27 = 112200211211873 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (112200211212101) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 184405620 + ... + 185013061.
It is an arithmetic number, because the mean of its divisors is an integer number (15300582971076).
Almost surely, 2112200211212001 is an apocalyptic number.
112200211212001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
112200211212001 is a deficient number, since it is larger than the sum of its proper divisors (10204452556607).
112200211212001 is a wasteful number, since it uses less digits than its factorization.
112200211212001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 369446303.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 112200211212001 its reverse (100212112002211), we get a palindrome (212412323214212).
The spelling of 112200211212001 in words is "one hundred twelve trillion, two hundred billion, two hundred eleven million, two hundred twelve thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •