Base | Representation |
---|---|
bin | 10011001001100110000110… |
… | …00001000110000100101010 |
3 | 12112002210012010202110200222 |
4 | 21210303003001012010222 |
5 | 21004422044042322442 |
6 | 225321330412530042 |
7 | 11604300042221435 |
oct | 1144630301060452 |
9 | 175083163673628 |
10 | 42111131214122 |
11 | 1246625980a973 |
12 | 4881504780922 |
13 | 1a660a77b81a9 |
14 | a5829249481c |
15 | 4d06192918d2 |
hex | 264cc304612a |
42111131214122 has 4 divisors (see below), whose sum is σ = 63166696821186. Its totient is φ = 21055565607060.
The previous prime is 42111131214067. The next prime is 42111131214149. The reversal of 42111131214122 is 22141213111124.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in only one way, i.e., 38756588779441 + 3354542434681 = 6225479^2 + 1831541^2 .
It is a super-3 number, since 3×421111312141223 (a number of 42 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 42111131214091 and 42111131214100.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10527782803529 + ... + 10527782803532.
Almost surely, 242111131214122 is an apocalyptic number.
42111131214122 is a deficient number, since it is larger than the sum of its proper divisors (21055565607064).
42111131214122 is a wasteful number, since it uses less digits than its factorization.
42111131214122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21055565607063.
The product of its digits is 768, while the sum is 26.
Adding to 42111131214122 its reverse (22141213111124), we get a palindrome (64252344325246).
The spelling of 42111131214122 in words is "forty-two trillion, one hundred eleven billion, one hundred thirty-one million, two hundred fourteen thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •