Base | Representation |
---|---|
bin | 10001100111111100011… |
… | …000100111010010111101 |
3 | 11021210010001011210021120 |
4 | 101213330120213102331 |
5 | 124320333222333041 |
6 | 2324214135221153 |
7 | 153333454112646 |
oct | 21477430472275 |
9 | 4253101153246 |
10 | 1211120121021 |
11 | 4276a6809658 |
12 | 1768818177b9 |
13 | 8a29237c385 |
14 | 428933466cd |
15 | 217860a6366 |
hex | 119fc6274bd |
1211120121021 has 16 divisors (see below), whose sum is σ = 1635067854336. Its totient is φ = 797302249776.
The previous prime is 1211120121019. The next prime is 1211120121023. The reversal of 1211120121021 is 1201210211121.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (1211120121019) and next prime (1211120121023).
It is not a de Polignac number, because 1211120121021 - 21 = 1211120121019 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1211120121023) 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, 648865 + ... + 1686198.
It is an arithmetic number, because the mean of its divisors is an integer number (102191740896).
Almost surely, 21211120121021 is an apocalyptic number.
It is an amenable number.
1211120121021 is a deficient number, since it is larger than the sum of its proper divisors (423947733315).
1211120121021 is a wasteful number, since it uses less digits than its factorization.
1211120121021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2337232.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 1211120121021 its reverse (1201210211121), we get a palindrome (2412330332142).
The spelling of 1211120121021 in words is "one trillion, two hundred eleven billion, one hundred twenty million, one hundred twenty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •