Base | Representation |
---|---|
bin | 10001110001001001110… |
… | …111111110011001000111 |
3 | 11022201122021221220112122 |
4 | 101301021313332121013 |
5 | 130001112042403221 |
6 | 2332531352240155 |
7 | 154133524536650 |
oct | 21611167763107 |
9 | 4281567856478 |
10 | 1221010122311 |
11 | 430911422a41 |
12 | 1787819a005b |
13 | 8b1aa334c45 |
14 | 43150a34527 |
15 | 21b64486eab |
hex | 11c49dfe647 |
1221010122311 has 16 divisors (see below), whose sum is σ = 1399577088000. Its totient is φ = 1043477991648.
The previous prime is 1221010122289. The next prime is 1221010122317. The reversal of 1221010122311 is 1132210101221.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 1221010122311 - 26 = 1221010122247 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1221010122311.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1221010122317) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 34533680 + ... + 34569018.
It is an arithmetic number, because the mean of its divisors is an integer number (87473568000).
Almost surely, 21221010122311 is an apocalyptic number.
1221010122311 is a deficient number, since it is larger than the sum of its proper divisors (178566965689).
1221010122311 is a wasteful number, since it uses less digits than its factorization.
1221010122311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49838.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 1221010122311 its reverse (1132210101221), we get a palindrome (2353220223532).
The spelling of 1221010122311 in words is "one trillion, two hundred twenty-one billion, ten million, one hundred twenty-two thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •