Base | Representation |
---|---|
bin | 11101001000101100110… |
… | …10001001001110000111 |
3 | 10112201000121112111202202 |
4 | 32210112122021032013 |
5 | 112400224423112411 |
6 | 2043522302425115 |
7 | 132220162631042 |
oct | 16442632111607 |
9 | 3481017474682 |
10 | 1001103332231 |
11 | 356624806812 |
12 | 14202b59219b |
13 | 73532a45152 |
14 | 3664cbb1c59 |
15 | 1b09355983b |
hex | e916689387 |
1001103332231 has 2 divisors, whose sum is σ = 1001103332232. Its totient is φ = 1001103332230.
The previous prime is 1001103332209. The next prime is 1001103332233. The reversal of 1001103332231 is 1322333011001.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1001103332231 - 26 = 1001103332167 is a prime.
It is a super-2 number, since 2×10011033322312 (a number of 25 digits) contains 22 as substring.
Together with 1001103332233, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1001103332233) 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 as a sum of consecutive naturals, namely, 500551666115 + 500551666116.
It is an arithmetic number, because the mean of its divisors is an integer number (500551666116).
Almost surely, 21001103332231 is an apocalyptic number.
1001103332231 is a deficient number, since it is larger than the sum of its proper divisors (1).
1001103332231 is an equidigital number, since it uses as much as digits as its factorization.
1001103332231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 1001103332231 its reverse (1322333011001), we get a palindrome (2323436343232).
The spelling of 1001103332231 in words is "one trillion, one billion, one hundred three million, three hundred thirty-two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •