Base | Representation |
---|---|
bin | 11101001000111010110… |
… | …11011010001000000011 |
3 | 10112201022211010221102222 |
4 | 32210131123122020003 |
5 | 112401000100313011 |
6 | 2043542111001255 |
7 | 132223122652253 |
oct | 16443533321003 |
9 | 3481284127388 |
10 | 1001221104131 |
11 | 356685236566 |
12 | 142062b0922b |
13 | 7355126bb71 |
14 | 366606ab963 |
15 | 1b09da6eddb |
hex | e91d6da203 |
1001221104131 has 4 divisors (see below), whose sum is σ = 1001233992672. Its totient is φ = 1001208215592.
The previous prime is 1001221104113. The next prime is 1001221104133. The reversal of 1001221104131 is 1314011221001.
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 1001221104131 - 218 = 1001220841987 is a prime.
It is a super-2 number, since 2×10012211041312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1001221104133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6327035 + ... + 6483348.
It is an arithmetic number, because the mean of its divisors is an integer number (250308498168).
Almost surely, 21001221104131 is an apocalyptic number.
1001221104131 is a deficient number, since it is larger than the sum of its proper divisors (12888541).
1001221104131 is an equidigital number, since it uses as much as digits as its factorization.
1001221104131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12888540.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 1001221104131 its reverse (1314011221001), we get a palindrome (2315232325132).
The spelling of 1001221104131 in words is "one trillion, one billion, two hundred twenty-one million, one hundred four thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •