Base | Representation |
---|---|
bin | 11001011110000110111101… |
… | …100011010111100000000101 |
3 | 112200122000202220001110000201 |
4 | 121132012331203113200011 |
5 | 104140314403341241401 |
6 | 1034125214001010501 |
7 | 32411123351140330 |
oct | 3136067543274005 |
9 | 480560686043021 |
10 | 112020222212101 |
11 | 32769567094265 |
12 | 10692329923a31 |
13 | 4a676002739b8 |
14 | 1d93b443db617 |
15 | ce3d82c01b01 |
hex | 65e1bd8d7805 |
112020222212101 has 8 divisors (see below), whose sum is σ = 128693389169664. Its totient is φ = 95514624772080.
The previous prime is 112020222211993. The next prime is 112020222212123. The reversal of 112020222212101 is 101212222020211.
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 112020222212101 - 213 = 112020222203909 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112020222212401) 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, 41892377950 + ... + 41892380623.
It is an arithmetic number, because the mean of its divisors is an integer number (16086673646208).
Almost surely, 2112020222212101 is an apocalyptic number.
It is an amenable number.
112020222212101 is a deficient number, since it is larger than the sum of its proper divisors (16673166957563).
112020222212101 is an equidigital number, since it uses as much as digits as its factorization.
112020222212101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 83784758771.
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 112020222212101 its reverse (101212222020211), we get a palindrome (213232444232312).
The spelling of 112020222212101 in words is "one hundred twelve trillion, twenty billion, two hundred twenty-two million, two hundred twelve thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •