Base | Representation |
---|---|
bin | 110010100001011100111010… |
… | …111001000101100101111010 |
3 | 1002010202012221011202222210102 |
4 | 302201130322321011211322 |
5 | 213111020344000232302 |
6 | 2104325441423515402 |
7 | 64542333631114154 |
oct | 6241347271054572 |
9 | 1063665834688712 |
10 | 222201121102202 |
11 | 64888a6a100010 |
12 | 20b08095a58b62 |
13 | 96ca625484b18 |
14 | 3cc283d685ad4 |
15 | 1aa4e639ca702 |
hex | ca173ae4597a |
222201121102202 has 8 divisors (see below), whose sum is σ = 363601834530912. Its totient is φ = 101000509591900.
The previous prime is 222201121102133. The next prime is 222201121102217. The reversal of 222201121102202 is 202201121102222.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-3 number, since 3×2222011211022023 (a number of 44 digits) contains 333 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5050025479574 + ... + 5050025479617.
It is an arithmetic number, because the mean of its divisors is an integer number (45450229316364).
Almost surely, 2222201121102202 is an apocalyptic number.
222201121102202 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
222201121102202 is a deficient number, since it is larger than the sum of its proper divisors (141400713428710).
222201121102202 is a wasteful number, since it uses less digits than its factorization.
222201121102202 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10100050959204.
The product of its (nonzero) digits is 256, while the sum is 20.
Adding to 222201121102202 its sum of digits (20), we get a palindrome (222201121102222).
Adding to 222201121102202 its reverse (202201121102222), we get a palindrome (424402242204424).
The spelling of 222201121102202 in words is "two hundred twenty-two trillion, two hundred one billion, one hundred twenty-one million, one hundred two thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •