Base | Representation |
---|---|
bin | 10001110000010100111… |
… | …100110111101110110110 |
3 | 11022122100102012110100210 |
4 | 101300110330313232312 |
5 | 124442302241311202 |
6 | 2332303313250250 |
7 | 154102523456646 |
oct | 21602474675666 |
9 | 4278312173323 |
10 | 1220122213302 |
11 | 4304a61a9843 |
12 | 178574563986 |
13 | 8b0983b2ab5 |
14 | 430a8b44526 |
15 | 21b11547c6c |
hex | 11c14f37bb6 |
1220122213302 has 8 divisors (see below), whose sum is σ = 2440244426616. Its totient is φ = 406707404432.
The previous prime is 1220122213259. The next prime is 1220122213307. The reversal of 1220122213302 is 2033122210221.
It is a sphenic number, since it is the product of 3 distinct primes.
1220122213302 is an admirable number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1220122213307) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 101676851103 + ... + 101676851114.
It is an arithmetic number, because the mean of its divisors is an integer number (305030553327).
Almost surely, 21220122213302 is an apocalyptic number.
1220122213302 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1220122213302 is a wasteful number, since it uses less digits than its factorization.
1220122213302 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 203353702222.
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 1220122213302 its reverse (2033122210221), we get a palindrome (3253244423523).
The spelling of 1220122213302 in words is "one trillion, two hundred twenty billion, one hundred twenty-two million, two hundred thirteen thousand, three hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •