Base | Representation |
---|---|
bin | 11101001000101101001… |
… | …00101000010100000111 |
3 | 10112201000210201011102011 |
4 | 32210112210220110013 |
5 | 112400231124043111 |
6 | 2043522441355051 |
7 | 132220225200040 |
oct | 16442644502407 |
9 | 3481023634364 |
10 | 1001106081031 |
11 | 356626313a51 |
12 | 142030498a87 |
13 | 73533498364 |
14 | 3664d2c98c7 |
15 | 1b0938ee021 |
hex | e916928507 |
1001106081031 has 8 divisors (see below), whose sum is σ = 1154617761440. Its totient is φ = 850218532128.
The previous prime is 1001106081029. The next prime is 1001106081103. The reversal of 1001106081031 is 1301806011001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1001106081031 - 21 = 1001106081029 is a prime.
It is a super-2 number, since 2×10011060810312 (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 = 1001106080993 and 1001106081011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1001106081331) by changing a digit.
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 in 7 ways as a sum of consecutive naturals, for example, 656032056 + ... + 656033581.
It is an arithmetic number, because the mean of its divisors is an integer number (144327220180).
Almost surely, 21001106081031 is an apocalyptic number.
1001106081031 is a deficient number, since it is larger than the sum of its proper divisors (153511680409).
1001106081031 is a wasteful number, since it uses less digits than its factorization.
1001106081031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1312065753.
The product of its (nonzero) digits is 144, while the sum is 22.
The spelling of 1001106081031 in words is "one trillion, one billion, one hundred six million, eighty-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •