Base | Representation |
---|---|
bin | 11110000001000000011… |
… | …00100101011011101001 |
3 | 10122121001022201020200102 |
4 | 33000200030211123221 |
5 | 113344132033233001 |
6 | 2105442034515145 |
7 | 134340243041453 |
oct | 17004014453351 |
9 | 3577038636612 |
10 | 1031332321001 |
11 | 368427232464 |
12 | 147a67135ab5 |
13 | 7633c6a4158 |
14 | 37cb97c72d3 |
15 | 1bc62316e6b |
hex | f0203256e9 |
1031332321001 has 4 divisors (see below), whose sum is σ = 1031468191104. Its totient is φ = 1031196450900.
The previous prime is 1031332320943. The next prime is 1031332321003. The reversal of 1031332321001 is 1001232331301.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1031332321001 - 230 = 1030258579177 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1031332321003) 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 3 ways as a sum of consecutive naturals, for example, 67923665 + ... + 67938846.
It is an arithmetic number, because the mean of its divisors is an integer number (257867047776).
Almost surely, 21031332321001 is an apocalyptic number.
It is an amenable number.
1031332321001 is a deficient number, since it is larger than the sum of its proper divisors (135870103).
1031332321001 is an equidigital number, since it uses as much as digits as its factorization.
1031332321001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 135870102.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 1031332321001 its reverse (1001232331301), we get a palindrome (2032564652302).
The spelling of 1031332321001 in words is "one trillion, thirty-one billion, three hundred thirty-two million, three hundred twenty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •