Base | Representation |
---|---|
bin | 1010001100110000010001… |
… | …1000100011010111110111 |
3 | 1110201001220012010120000001 |
4 | 2203030010120203113313 |
5 | 2432213222141430223 |
6 | 35503425251332131 |
7 | 2235126103022251 |
oct | 243140430432767 |
9 | 43631805116001 |
10 | 11214233155063 |
11 | 3633a25297184 |
12 | 1311487bb1047 |
13 | 634661447473 |
14 | 2aaab3aa2cd1 |
15 | 146a944699ad |
hex | a33046235f7 |
11214233155063 has 2 divisors, whose sum is σ = 11214233155064. Its totient is φ = 11214233155062.
The previous prime is 11214233155049. The next prime is 11214233155091. The reversal of 11214233155063 is 36055133241211.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 11214233155063 - 25 = 11214233155031 is a prime.
It is a super-2 number, since 2×112142331550632 (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 (11214233155043) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5607116577531 + 5607116577532.
It is an arithmetic number, because the mean of its divisors is an integer number (5607116577532).
Almost surely, 211214233155063 is an apocalyptic number.
11214233155063 is a deficient number, since it is larger than the sum of its proper divisors (1).
11214233155063 is an equidigital number, since it uses as much as digits as its factorization.
11214233155063 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 64800, while the sum is 37.
Adding to 11214233155063 its reverse (36055133241211), we get a palindrome (47269366396274).
It can be divided in two parts, 11214233 and 155063, that added together give a triangular number (11369296 = T4768).
The spelling of 11214233155063 in words is "eleven trillion, two hundred fourteen billion, two hundred thirty-three million, one hundred fifty-five thousand, sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •