Base | Representation |
---|---|
bin | 111100110101011… |
… | …010101111011001 |
3 | 2122010111200112211 |
4 | 330311122233121 |
5 | 4042240323441 |
6 | 245135435121 |
7 | 34202156341 |
oct | 7465325731 |
9 | 2563450484 |
10 | 1020636121 |
11 | 48413902a |
12 | 245985aa1 |
13 | 1335b3ccb |
14 | 9979dd21 |
15 | 5e90aa81 |
hex | 3cd5abd9 |
1020636121 has 8 divisors (see below), whose sum is σ = 1056934080. Its totient is φ = 984411792.
The previous prime is 1020636107. The next prime is 1020636151. The reversal of 1020636121 is 1216360201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1020636121 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1020636092 and 1020636101.
It is not an unprimeable number, because it can be changed into a prime (1020636101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10606 + ... + 46408.
It is an arithmetic number, because the mean of its divisors is an integer number (132116760).
Almost surely, 21020636121 is an apocalyptic number.
It is an amenable number.
1020636121 is a deficient number, since it is larger than the sum of its proper divisors (36297959).
1020636121 is an equidigital number, since it uses as much as digits as its factorization.
1020636121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36815.
The product of its (nonzero) digits is 432, while the sum is 22.
The square root of 1020636121 is about 31947.3961536774. The cubic root of 1020636121 is about 1006.8319255001.
Adding to 1020636121 its reverse (1216360201), we get a palindrome (2236996322).
The spelling of 1020636121 in words is "one billion, twenty million, six hundred thirty-six thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •