Base | Representation |
---|---|
bin | 110010011110100001110011… |
… | …000100010010110101011100 |
3 | 1002010001000022122110121110020 |
4 | 302132201303010102311130 |
5 | 213044222402211214322 |
6 | 2104053252313312140 |
7 | 64521661624563111 |
oct | 6236416304226534 |
9 | 1063030278417406 |
10 | 222000200101212 |
11 | 64810835473175 |
12 | 20a95161a05650 |
13 | 96b46b53c8360 |
14 | 3cb6c1d13c908 |
15 | 1a9eb0477c05c |
hex | c9e873112d5c |
222000200101212 has 24 divisors (see below), whose sum is σ = 557846656664976. Its totient is φ = 68307753877248.
The previous prime is 222000200101159. The next prime is 222000200101279. The reversal of 222000200101212 is 212101002000222.
It is a junction number, because it is equal to n+sod(n) for n = 222000200101191 and 222000200101200.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 711539102733 + ... + 711539103044.
It is an arithmetic number, because the mean of its divisors is an integer number (23243610694374).
Almost surely, 2222000200101212 is an apocalyptic number.
It is an amenable number.
222000200101212 is an abundant number, since it is smaller than the sum of its proper divisors (335846456563764).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
222000200101212 is a wasteful number, since it uses less digits than its factorization.
222000200101212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1423078205797 (or 1423078205795 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 222000200101212 its reverse (212101002000222), we get a palindrome (434101202101434).
The spelling of 222000200101212 in words is "two hundred twenty-two trillion, two hundred million, one hundred one thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •