Base | Representation |
---|---|
bin | 11001100000110111101101… |
… | …010100100100100110101001 |
3 | 112201022011121222120202220111 |
4 | 121200313231110210212221 |
5 | 104201422041030413001 |
6 | 1034352321404454321 |
7 | 32430622313341525 |
oct | 3140675524444651 |
9 | 481264558522814 |
10 | 112210002201001 |
11 | 32831aa3a2a8a1 |
12 | 1070307284a3a1 |
13 | 4a7c486132c13 |
14 | 1d9cdc9048d85 |
15 | ce8c8dd09851 |
hex | 660ded5249a9 |
112210002201001 has 8 divisors (see below), whose sum is σ = 115299953619840. Its totient is φ = 109141887895152.
The previous prime is 112210002200999. The next prime is 112210002201023. The reversal of 112210002201001 is 100102200012211.
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 112210002201001 - 21 = 112210002200999 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (112210002291001) 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 7 ways as a sum of consecutive naturals, for example, 5459267830 + ... + 5459288383.
It is an arithmetic number, because the mean of its divisors is an integer number (14412494202480).
Almost surely, 2112210002201001 is an apocalyptic number.
It is an amenable number.
112210002201001 is a deficient number, since it is larger than the sum of its proper divisors (3089951418839).
112210002201001 is a wasteful number, since it uses less digits than its factorization.
112210002201001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10918556495.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 112210002201001 its reverse (100102200012211), we get a palindrome (212312202213212).
The spelling of 112210002201001 in words is "one hundred twelve trillion, two hundred ten billion, two million, two hundred one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •