Base | Representation |
---|---|
bin | 11101101111110110010… |
… | …11011100100110111011 |
3 | 10121201021101121110222110 |
4 | 32313323023130212323 |
5 | 113221301030044011 |
6 | 2101320035223403 |
7 | 133563055651545 |
oct | 16677313344673 |
9 | 3551241543873 |
10 | 1022121331131 |
11 | 36452a93243a |
12 | 146116447b63 |
13 | 755022bc5a4 |
14 | 3768436c695 |
15 | 1b8c385eba6 |
hex | edfb2dc9bb |
1022121331131 has 4 divisors (see below), whose sum is σ = 1362828441512. Its totient is φ = 681414220752.
The previous prime is 1022121331129. The next prime is 1022121331193. The reversal of 1022121331131 is 1311331212201.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 1022121331131 - 21 = 1022121331129 is a prime.
It is a super-2 number, since 2×10221213311312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1022121331098 and 1022121331107.
It is not an unprimeable number, because it can be changed into a prime (1022121331831) 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, 170353555186 + ... + 170353555191.
It is an arithmetic number, because the mean of its divisors is an integer number (340707110378).
Almost surely, 21022121331131 is an apocalyptic number.
1022121331131 is a deficient number, since it is larger than the sum of its proper divisors (340707110381).
1022121331131 is an equidigital number, since it uses as much as digits as its factorization.
1022121331131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 340707110380.
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 1022121331131 its reverse (1311331212201), we get a palindrome (2333452543332).
The spelling of 1022121331131 in words is "one trillion, twenty-two billion, one hundred twenty-one million, three hundred thirty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •