Base | Representation |
---|---|
bin | 10001110000100111010… |
… | …111010101010111010111 |
3 | 11022200010221111120112212 |
4 | 101300213113111113113 |
5 | 124443420332442221 |
6 | 2332354110504035 |
7 | 154113264346535 |
oct | 21604727252727 |
9 | 4280127446485 |
10 | 1220431140311 |
11 | 430644620219 |
12 | 17863bb0501b |
13 | 8b1173b7c46 |
14 | 430d7b9d155 |
15 | 21b2d71bb5b |
hex | 11c275d55d7 |
1220431140311 has 2 divisors, whose sum is σ = 1220431140312. Its totient is φ = 1220431140310.
The previous prime is 1220431140283. The next prime is 1220431140319. The reversal of 1220431140311 is 1130411340221.
It is a strong prime.
It is an emirp because it is prime and its reverse (1130411340221) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1220431140311 is a prime.
It is a super-3 number, since 3×12204311403113 (a number of 37 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1220431140319) 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 as a sum of consecutive naturals, namely, 610215570155 + 610215570156.
It is an arithmetic number, because the mean of its divisors is an integer number (610215570156).
Almost surely, 21220431140311 is an apocalyptic number.
1220431140311 is a deficient number, since it is larger than the sum of its proper divisors (1).
1220431140311 is an equidigital number, since it uses as much as digits as its factorization.
1220431140311 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 1220431140311 its reverse (1130411340221), we get a palindrome (2350842480532).
The spelling of 1220431140311 in words is "one trillion, two hundred twenty billion, four hundred thirty-one million, one hundred forty thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •