Base | Representation |
---|---|
bin | 10001100111000110110… |
… | …110100110001101010101 |
3 | 11021200210110020002020122 |
4 | 101213012312212031111 |
5 | 124312013313324341 |
6 | 2323545053441325 |
7 | 153302300236016 |
oct | 21470666461525 |
9 | 4250713202218 |
10 | 1210222011221 |
11 | 427285858453 |
12 | 176670aa0245 |
13 | 8a17b298162 |
14 | 42809d5d00d |
15 | 217322ee94b |
hex | 119c6da6355 |
1210222011221 has 8 divisors (see below), whose sum is σ = 1225564354560. Its totient is φ = 1194897795552.
The previous prime is 1210222011211. The next prime is 1210222011247. The reversal of 1210222011221 is 1221102220121.
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 1210222011221 - 214 = 1210221994837 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 1210222011221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1210222011211) 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, 4397525 + ... + 4664618.
It is an arithmetic number, because the mean of its divisors is an integer number (153195544320).
Almost surely, 21210222011221 is an apocalyptic number.
It is an amenable number.
1210222011221 is a deficient number, since it is larger than the sum of its proper divisors (15342343339).
1210222011221 is an equidigital number, since it uses as much as digits as its factorization.
1210222011221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9063835.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 1210222011221 its reverse (1221102220121), we get a palindrome (2431324231342).
The spelling of 1210222011221 in words is "one trillion, two hundred ten billion, two hundred twenty-two million, eleven thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •