Base | Representation |
---|---|
bin | 100000010011101000011… |
… | …101101110110111110011 |
3 | 21212020110210220120210002 |
4 | 200103220131232313303 |
5 | 242333232411424021 |
6 | 4415522405100215 |
7 | 316253141054606 |
oct | 40235035566763 |
9 | 7766423816702 |
10 | 2220103233011 |
11 | 7865a4440544 |
12 | 2ba3300b766b |
13 | 13147c7643a1 |
14 | 7964c84a33d |
15 | 3cb3b2b050b |
hex | 204e876edf3 |
2220103233011 has 2 divisors, whose sum is σ = 2220103233012. Its totient is φ = 2220103233010.
The previous prime is 2220103232999. The next prime is 2220103233031. The reversal of 2220103233011 is 1103323010222.
It is an a-pointer prime, because the next prime (2220103233031) can be obtained adding 2220103233011 to its sum of digits (20).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 2220103233011 - 210 = 2220103231987 is a prime.
It is a super-2 number, since 2×22201032330112 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (2220103233031) 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, 1110051616505 + 1110051616506.
It is an arithmetic number, because the mean of its divisors is an integer number (1110051616506).
Almost surely, 22220103233011 is an apocalyptic number.
2220103233011 is a deficient number, since it is larger than the sum of its proper divisors (1).
2220103233011 is an equidigital number, since it uses as much as digits as its factorization.
2220103233011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 2220103233011 its reverse (1103323010222), we get a palindrome (3323426243233).
The spelling of 2220103233011 in words is "two trillion, two hundred twenty billion, one hundred three million, two hundred thirty-three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •