Base | Representation |
---|---|
bin | 10001110010001100101… |
… | …111101011110000011101 |
3 | 11022211112111000100000010 |
4 | 101302030233223300131 |
5 | 130010411244203201 |
6 | 2333234550353433 |
7 | 154203366534261 |
oct | 21621457536035 |
9 | 4284474010003 |
10 | 1222132022301 |
11 | 431337736013 |
12 | 178a3565b879 |
13 | 8b3288b2aa8 |
14 | 43219a340a1 |
15 | 21bccbe6bd6 |
hex | 11c8cbebc1d |
1222132022301 has 8 divisors (see below), whose sum is σ = 1630522116160. Its totient is φ = 814248304992.
The previous prime is 1222132022281. The next prime is 1222132022311. The reversal of 1222132022301 is 1032202312221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1222132022301 - 210 = 1222132021277 is a prime.
It is a super-2 number, since 2×12221320223012 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1222132022311) 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, 126588505 + ... + 126598158.
It is an arithmetic number, because the mean of its divisors is an integer number (203815264520).
Almost surely, 21222132022301 is an apocalyptic number.
It is an amenable number.
1222132022301 is a deficient number, since it is larger than the sum of its proper divisors (408390093859).
1222132022301 is a wasteful number, since it uses less digits than its factorization.
1222132022301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 253188275.
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 1222132022301 its reverse (1032202312221), we get a palindrome (2254334334522).
The spelling of 1222132022301 in words is "one trillion, two hundred twenty-two billion, one hundred thirty-two million, twenty-two thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •