Base | Representation |
---|---|
bin | 11001100000110111111001… |
… | …110001000101001010110011 |
3 | 112201022012011112110220200012 |
4 | 121200313321301011022303 |
5 | 104201423003004013021 |
6 | 1034352354224045135 |
7 | 32430630430200104 |
oct | 3140677161051263 |
9 | 481265145426605 |
10 | 112210211001011 |
11 | 328320a0883392 |
12 | 107031107637ab |
13 | 4a7c4ba47b816 |
14 | 1d9d008a7c3ab |
15 | ce8ca230135b |
hex | 660df9c452b3 |
112210211001011 has 4 divisors (see below), whose sum is σ = 112210294762632. Its totient is φ = 112210127239392.
The previous prime is 112210211000879. The next prime is 112210211001017. The reversal of 112210211001011 is 110100112012211.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 112210211001011 - 222 = 112210206806707 is a prime.
It is a super-2 number, since 2×1122102110010112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (112210211001017) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 39838145 + ... + 42561698.
It is an arithmetic number, because the mean of its divisors is an integer number (28052573690658).
Almost surely, 2112210211001011 is an apocalyptic number.
112210211001011 is a deficient number, since it is larger than the sum of its proper divisors (83761621).
112210211001011 is an equidigital number, since it uses as much as digits as its factorization.
112210211001011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 83761620.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 112210211001011 its reverse (110100112012211), we get a palindrome (222310323013222).
The spelling of 112210211001011 in words is "one hundred twelve trillion, two hundred ten billion, two hundred eleven million, one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •