Base | Representation |
---|---|
bin | 10001110000001110111… |
… | …011001010001001000001 |
3 | 11022122002100221102112012 |
4 | 101300032323022021001 |
5 | 124442100400213441 |
6 | 2332245302142305 |
7 | 154100155153154 |
oct | 21601673121101 |
9 | 4278070842465 |
10 | 1220021101121 |
11 | 430454118759 |
12 | 178546721995 |
13 | 8b08046ccc4 |
14 | 43099543c9b |
15 | 21b077239eb |
hex | 11c0eeca241 |
1220021101121 has 24 divisors (see below), whose sum is σ = 1289956227840. Its totient is φ = 1152662162400.
The previous prime is 1220021101037. The next prime is 1220021101129. The reversal of 1220021101121 is 1211011200221.
It is a de Polignac number, because none of the positive numbers 2k-1220021101121 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1220021101096 and 1220021101105.
It is not an unprimeable number, because it can be changed into a prime (1220021101129) 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 in 23 ways as a sum of consecutive naturals, for example, 172583975 + ... + 172591043.
It is an arithmetic number, because the mean of its divisors is an integer number (53748176160).
Almost surely, 21220021101121 is an apocalyptic number.
It is an amenable number.
1220021101121 is a deficient number, since it is larger than the sum of its proper divisors (69935126719).
1220021101121 is an equidigital number, since it uses as much as digits as its factorization.
1220021101121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10197 (or 10154 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 1220021101121 its reverse (1211011200221), we get a palindrome (2431032301342).
The spelling of 1220021101121 in words is "one trillion, two hundred twenty billion, twenty-one million, one hundred one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •