Base | Representation |
---|---|
bin | 11101001000100100010… |
… | …10011111111010010001 |
3 | 10112200211122112122200211 |
4 | 32210102022133322101 |
5 | 112400103210401001 |
6 | 2043511240244121 |
7 | 132215336434042 |
oct | 16442212377221 |
9 | 3480748478624 |
10 | 1001032122001 |
11 | 35659859948a |
12 | 14200b770641 |
13 | 73521071812 |
14 | 366435568c9 |
15 | 1b08c190351 |
hex | e91229fe91 |
1001032122001 has 4 divisors (see below), whose sum is σ = 1001042330112. Its totient is φ = 1001021913892.
The previous prime is 1001032121993. The next prime is 1001032122017. The reversal of 1001032122001 is 1002212301001.
1001032122001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 1001032122001 - 23 = 1001032121993 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1001032122031) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4955521 + ... + 5153566.
It is an arithmetic number, because the mean of its divisors is an integer number (250260582528).
Almost surely, 21001032122001 is an apocalyptic number.
It is an amenable number.
1001032122001 is a deficient number, since it is larger than the sum of its proper divisors (10208111).
1001032122001 is an equidigital number, since it uses as much as digits as its factorization.
1001032122001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10208110.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 1001032122001 its reverse (1002212301001), we get a palindrome (2003244423002).
The spelling of 1001032122001 in words is "one trillion, one billion, thirty-two million, one hundred twenty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •