Base | Representation |
---|---|
bin | 10000010100000010000… |
… | …111111111100011101111 |
3 | 10222011112221212210211201 |
4 | 100110002013333203233 |
5 | 121331323130122111 |
6 | 2214553534230331 |
7 | 143663654514511 |
oct | 20240207774357 |
9 | 3864487783751 |
10 | 1121022114031 |
11 | 3a2471838456 |
12 | 1613180553a7 |
13 | 819341637c1 |
14 | 3c387415bb1 |
15 | 1e26131a6c1 |
hex | 105021ff8ef |
1121022114031 has 4 divisors (see below), whose sum is σ = 1121170621000. Its totient is φ = 1120873607064.
The previous prime is 1121022114029. The next prime is 1121022114077. The reversal of 1121022114031 is 1304112201211.
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 1121022114031 - 21 = 1121022114029 is a prime.
It is a super-3 number, since 3×11210221140313 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1121022111031) 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, 74242161 + ... + 74257258.
It is an arithmetic number, because the mean of its divisors is an integer number (280292655250).
Almost surely, 21121022114031 is an apocalyptic number.
1121022114031 is a deficient number, since it is larger than the sum of its proper divisors (148506969).
1121022114031 is an equidigital number, since it uses as much as digits as its factorization.
1121022114031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 148506968.
The product of its (nonzero) digits is 96, while the sum is 19.
Adding to 1121022114031 its reverse (1304112201211), we get a palindrome (2425134315242).
The spelling of 1121022114031 in words is "one trillion, one hundred twenty-one billion, twenty-two million, one hundred fourteen thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •