Base | Representation |
---|---|
bin | 111100110011011… |
… | …010100011000001 |
3 | 2122002112000021102 |
4 | 330303122203001 |
5 | 4042122023131 |
6 | 245120304145 |
7 | 34164541445 |
oct | 7463324301 |
9 | 2562460242 |
10 | 1020111041 |
11 | 48390a584 |
12 | 245772055 |
13 | 13345c001 |
14 | 996a4825 |
15 | 5e8551cb |
hex | 3ccda8c1 |
1020111041 has 2 divisors, whose sum is σ = 1020111042. Its totient is φ = 1020111040.
The previous prime is 1020111013. The next prime is 1020111091. The reversal of 1020111041 is 1401110201.
1020111041 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 998812816 + 21298225 = 31604^2 + 4615^2 .
It is a cyclic number.
It is not a de Polignac number, because 1020111041 - 218 = 1019848897 is a prime.
It is not a weakly prime, because it can be changed into another prime (1020111011) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 510055520 + 510055521.
It is an arithmetic number, because the mean of its divisors is an integer number (510055521).
Almost surely, 21020111041 is an apocalyptic number.
It is an amenable number.
1020111041 is a deficient number, since it is larger than the sum of its proper divisors (1).
1020111041 is an equidigital number, since it uses as much as digits as its factorization.
1020111041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 11.
The square root of 1020111041 is about 31939.1772123203. The cubic root of 1020111041 is about 1006.6592364674.
Adding to 1020111041 its reverse (1401110201), we get a palindrome (2421221242).
It can be divided in two parts, 102011 and 1041, that multiplied together give a triangular number (106193451 = T14573).
The spelling of 1020111041 in words is "one billion, twenty million, one hundred eleven thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •