Base | Representation |
---|---|
bin | 10001101000111101010… |
… | …110111011111010011101 |
3 | 11021212221000100112211021 |
4 | 101220331112323322131 |
5 | 124330101302401341 |
6 | 2324514235324141 |
7 | 153402461456266 |
oct | 21507526737235 |
9 | 4255830315737 |
10 | 1212210200221 |
11 | 428106068259 |
12 | 176b268b0651 |
13 | 8a407168557 |
14 | 4295802196d |
15 | 217ebb2c9d1 |
hex | 11a3d5bbe9d |
1212210200221 has 8 divisors (see below), whose sum is σ = 1219453512480. Its totient is φ = 1204969604592.
The previous prime is 1212210200219. The next prime is 1212210200231. The reversal of 1212210200221 is 1220020122121.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1212210200221 - 21 = 1212210200219 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1212210200195 and 1212210200204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1212210200231) 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, 219486 + ... + 1572448.
It is an arithmetic number, because the mean of its divisors is an integer number (152431689060).
Almost surely, 21212210200221 is an apocalyptic number.
It is an amenable number.
1212210200221 is a deficient number, since it is larger than the sum of its proper divisors (7243312259).
1212210200221 is a wasteful number, since it uses less digits than its factorization.
1212210200221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1358315.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 1212210200221 its reverse (1220020122121), we get a palindrome (2432230322342).
The spelling of 1212210200221 in words is "one trillion, two hundred twelve billion, two hundred ten million, two hundred thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •