Base | Representation |
---|---|
bin | 1010001101000110100011… |
… | …0000000111101111100111 |
3 | 1110201122022212102110220101 |
4 | 2203101220300013233213 |
5 | 2432312443234202442 |
6 | 35510254431244531 |
7 | 2235430212403024 |
oct | 243215060075747 |
9 | 43648285373811 |
10 | 11220212022247 |
11 | 36365131a3628 |
12 | 1312676379747 |
13 | 6350a50242b7 |
14 | 2ab0bdb7054b |
15 | 146ce42cacb7 |
hex | a3468c07be7 |
11220212022247 has 2 divisors, whose sum is σ = 11220212022248. Its totient is φ = 11220212022246.
The previous prime is 11220212022163. The next prime is 11220212022251. The reversal of 11220212022247 is 74222021202211.
11220212022247 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 11220212022247 - 227 = 11220077804519 is a prime.
It is a super-2 number, since 2×112202120222472 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11220212022277) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5610106011123 + 5610106011124.
It is an arithmetic number, because the mean of its divisors is an integer number (5610106011124).
Almost surely, 211220212022247 is an apocalyptic number.
11220212022247 is a deficient number, since it is larger than the sum of its proper divisors (1).
11220212022247 is an equidigital number, since it uses as much as digits as its factorization.
11220212022247 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3584, while the sum is 28.
Adding to 11220212022247 its reverse (74222021202211), we get a palindrome (85442233224458).
The spelling of 11220212022247 in words is "eleven trillion, two hundred twenty billion, two hundred twelve million, twenty-two thousand, two hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •