Base | Representation |
---|---|
bin | 110010100001011100111010… |
… | …110100111000110011000111 |
3 | 1002010202012221002201001112102 |
4 | 302201130322310320303013 |
5 | 213111020343210014343 |
6 | 2104325441344142315 |
7 | 64542333615550256 |
oct | 6241347264706307 |
9 | 1063665832631472 |
10 | 222201120001223 |
11 | 64888a69518910 |
12 | 20b0809560799b |
13 | 96ca62518a95c |
14 | 3cc283d47a79d |
15 | 1aa4e6385e3b8 |
hex | ca173ad38cc7 |
222201120001223 has 32 divisors (see below), whose sum is σ = 256743816782400. Its totient is φ = 190056617820160.
The previous prime is 222201120001111. The next prime is 222201120001247. The reversal of 222201120001223 is 322100021102222.
It is a cyclic number.
It is not a de Polignac number, because 222201120001223 - 210 = 222201120000199 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 222201120001195 and 222201120001204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (222201120003223) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 9354643115 + ... + 9354666867.
It is an arithmetic number, because the mean of its divisors is an integer number (8023244274450).
Almost surely, 2222201120001223 is an apocalyptic number.
222201120001223 is a deficient number, since it is larger than the sum of its proper divisors (34542696781177).
222201120001223 is a wasteful number, since it uses less digits than its factorization.
222201120001223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37987.
The product of its (nonzero) digits is 384, while the sum is 20.
Adding to 222201120001223 its reverse (322100021102222), we get a palindrome (544301141103445).
The spelling of 222201120001223 in words is "two hundred twenty-two trillion, two hundred one billion, one hundred twenty million, one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.109 sec. • engine limits •