Base | Representation |
---|---|
bin | 10001110010100000101… |
… | …100001010000100101101 |
3 | 11022212101210122210020111 |
4 | 101302200230022010231 |
5 | 130012102430022341 |
6 | 2333332102420021 |
7 | 154214602003456 |
oct | 21624054120455 |
9 | 4285353583214 |
10 | 1222466642221 |
11 | 431499605a00 |
12 | 178b09731611 |
13 | 8b380012646 |
14 | 4324c25a12d |
15 | 21bec293681 |
hex | 11ca0b0a12d |
1222466642221 has 12 divisors (see below), whose sum is σ = 1357007007132. Its totient is φ = 1100330000000.
The previous prime is 1222466642167. The next prime is 1222466642227.
1222466642221 is nontrivially palindromic in base 10.
It can be written as a sum of positive squares in 2 ways, for example, as 1207822980100 + 14643662121 = 1099010^2 + 121011^2 .
It is not a de Polignac number, because 1222466642221 - 223 = 1222458253613 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1222466642227) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 50002780 + ... + 50027221.
It is an arithmetic number, because the mean of its divisors is an integer number (113083917261).
Almost surely, 21222466642221 is an apocalyptic number.
1222466642221 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1222466642221 is a deficient number, since it is larger than the sum of its proper divisors (134540364911).
1222466642221 is a wasteful number, since it uses less digits than its factorization.
1222466642221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 100030124 (or 100030113 counting only the distinct ones).
The product of its digits is 221184, while the sum is 40.
The spelling of 1222466642221 in words is "one trillion, two hundred twenty-two billion, four hundred sixty-six million, six hundred forty-two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •