Base | Representation |
---|---|
bin | 10001110000011010111… |
… | …101010110000110111101 |
3 | 11022122121102212000010021 |
4 | 101300122331112012331 |
5 | 124443004042013041 |
6 | 2332321313412141 |
7 | 154105156242463 |
oct | 21603275260675 |
9 | 4278542760107 |
10 | 1220223001021 |
11 | 430548089082 |
12 | 1785a226a051 |
13 | 8b0b3240cbb |
14 | 430b829c833 |
15 | 21b1a305cd1 |
hex | 11c1af561bd |
1220223001021 has 8 divisors (see below), whose sum is σ = 1277325669888. Its totient is φ = 1164229122000.
The previous prime is 1220223000977. The next prime is 1220223001037. The reversal of 1220223001021 is 1201003220221.
It is a happy number.
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-1220223001021 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1220223000986 and 1220223001004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1220223001321) 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, 277195210 + ... + 277199611.
It is an arithmetic number, because the mean of its divisors is an integer number (159665708736).
Almost surely, 21220223001021 is an apocalyptic number.
It is an amenable number.
1220223001021 is a deficient number, since it is larger than the sum of its proper divisors (57102668867).
1220223001021 is an equidigital number, since it uses as much as digits as its factorization.
1220223001021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 554394923.
The product of its (nonzero) digits is 96, while the sum is 16.
Adding to 1220223001021 its reverse (1201003220221), we get a palindrome (2421226221242).
The spelling of 1220223001021 in words is "one trillion, two hundred twenty billion, two hundred twenty-three million, one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.133 sec. • engine limits •