Base | Representation |
---|---|
bin | 11101001001000111111… |
… | …11110100001011100011 |
3 | 10112201121111112001022010 |
4 | 32210203333310023203 |
5 | 112401211303430311 |
6 | 2044001045044003 |
7 | 132225631466121 |
oct | 16444377641343 |
9 | 3481544461263 |
10 | 1001331311331 |
11 | 35673146989a |
12 | 1420939b6603 |
13 | 7356b047620 |
14 | 36671198911 |
15 | 1b0a858dda6 |
hex | e923ff42e3 |
1001331311331 has 16 divisors (see below), whose sum is σ = 1522386067104. Its totient is φ = 579956596224.
The previous prime is 1001331311329. The next prime is 1001331311341. The reversal of 1001331311331 is 1331131331001.
It is not a de Polignac number, because 1001331311331 - 21 = 1001331311329 is a prime.
It is a super-2 number, since 2×10013313113312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1001331311298 and 1001331311307.
It is not an unprimeable number, because it can be changed into a prime (1001331311341) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 755151156 + ... + 755152481.
It is an arithmetic number, because the mean of its divisors is an integer number (95149129194).
Almost surely, 21001331311331 is an apocalyptic number.
1001331311331 is a deficient number, since it is larger than the sum of its proper divisors (521054755773).
1001331311331 is a wasteful number, since it uses less digits than its factorization.
1001331311331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1510303670.
The product of its (nonzero) digits is 243, while the sum is 21.
Adding to 1001331311331 its reverse (1331131331001), we get a palindrome (2332462642332).
The spelling of 1001331311331 in words is "one trillion, one billion, three hundred thirty-one million, three hundred eleven thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •