Base | Representation |
---|---|
bin | 111100110011011… |
… | …000110110100101 |
3 | 2122002111122202101 |
4 | 330303120312211 |
5 | 4042121312401 |
6 | 245120212101 |
7 | 34164512302 |
oct | 7463306645 |
9 | 2562448671 |
10 | 1020104101 |
11 | 483905345 |
12 | 24576a031 |
13 | 133458ac3 |
14 | 996a20a9 |
15 | 5e853101 |
hex | 3ccd8da5 |
1020104101 has 2 divisors, whose sum is σ = 1020104102. Its totient is φ = 1020104100.
The previous prime is 1020104083. The next prime is 1020104123. The reversal of 1020104101 is 1014010201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 948701601 + 71402500 = 30801^2 + 8450^2 .
It is a cyclic number.
It is not a de Polignac number, because 1020104101 - 215 = 1020071333 is a prime.
It is a super-2 number, since 2×10201041012 = 2081224753754036402, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1020104191) 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 as a sum of consecutive naturals, namely, 510052050 + 510052051.
It is an arithmetic number, because the mean of its divisors is an integer number (510052051).
Almost surely, 21020104101 is an apocalyptic number.
It is an amenable number.
1020104101 is a deficient number, since it is larger than the sum of its proper divisors (1).
1020104101 is an equidigital number, since it uses as much as digits as its factorization.
1020104101 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 10.
The square root of 1020104101 is about 31939.0685681345. The cubic root of 1020104101 is about 1006.6569536339.
Adding to 1020104101 its reverse (1014010201), we get a palindrome (2034114302).
The spelling of 1020104101 in words is "one billion, twenty million, one hundred four thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •