Base | Representation |
---|---|
bin | 11101011001011111101… |
… | …10110101111000111101 |
3 | 10120120022000101212202012 |
4 | 32230233312311320331 |
5 | 113022211234021341 |
6 | 2052013125541005 |
7 | 132656502130160 |
oct | 16545766657075 |
9 | 3516260355665 |
10 | 1010120220221 |
11 | 35a431592162 |
12 | 143927274765 |
13 | 7433bb59228 |
14 | 36c66541ad7 |
15 | 1b41ee700eb |
hex | eb2fdb5e3d |
1010120220221 has 8 divisors (see below), whose sum is σ = 1161776123520. Its totient is φ = 860302570608.
The previous prime is 1010120220163. The next prime is 1010120220269. The reversal of 1010120220221 is 1220220210101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1010120220221 - 218 = 1010119958077 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1010120220196 and 1010120220205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1010120220821) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 459562241 + ... + 459564438.
It is an arithmetic number, because the mean of its divisors is an integer number (145222015440).
Almost surely, 21010120220221 is an apocalyptic number.
It is an amenable number.
1010120220221 is a deficient number, since it is larger than the sum of its proper divisors (151655903299).
1010120220221 is an equidigital number, since it uses as much as digits as its factorization.
1010120220221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 919126843.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 1010120220221 its reverse (1220220210101), we get a palindrome (2230340430322).
The spelling of 1010120220221 in words is "one trillion, ten billion, one hundred twenty million, two hundred twenty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •