Base | Representation |
---|---|
bin | 11101001000100010111… |
… | …00010011000111111001 |
3 | 10112200210210202100112021 |
4 | 32210101130103013321 |
5 | 112400042110323001 |
6 | 2043510124514441 |
7 | 132215131463023 |
oct | 16442134230771 |
9 | 3480723670467 |
10 | 1001020011001 |
11 | 35659177729a |
12 | 1420076aba21 |
13 | 7351b6c114a |
14 | 36641ac3013 |
15 | 1b08b09bba1 |
hex | e9117131f9 |
1001020011001 has 2 divisors, whose sum is σ = 1001020011002. Its totient is φ = 1001020011000.
The previous prime is 1001020010987. The next prime is 1001020011011. The reversal of 1001020011001 is 1001100201001.
1001020011001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 748839276025 + 252180734976 = 865355^2 + 502176^2 .
It is a cyclic number.
It is not a de Polignac number, because 1001020011001 - 211 = 1001020008953 is a prime.
It is a super-2 number, since 2×10010200110012 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1001020011011) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 500510005500 + 500510005501.
It is an arithmetic number, because the mean of its divisors is an integer number (500510005501).
Almost surely, 21001020011001 is an apocalyptic number.
It is an amenable number.
1001020011001 is a deficient number, since it is larger than the sum of its proper divisors (1).
1001020011001 is an equidigital number, since it uses as much as digits as its factorization.
1001020011001 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2, while the sum is 7.
Adding to 1001020011001 its reverse (1001100201001), we get a palindrome (2002120212002).
The spelling of 1001020011001 in words is "one trillion, one billion, twenty million, eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •