Base | Representation |
---|---|
bin | 1100011101001110110… |
… | …1001001101010010101 |
3 | 202110101101120212222102 |
4 | 3013103231021222111 |
5 | 12001240314214013 |
6 | 242151310411445 |
7 | 21314151260036 |
oct | 3072355115225 |
9 | 673341525872 |
10 | 214005226133 |
11 | 82839409956 |
12 | 35585b00b85 |
13 | 17246a3aa2a |
14 | a502158a8d |
15 | 5877c8ad58 |
hex | 31d3b49a95 |
214005226133 has 2 divisors, whose sum is σ = 214005226134. Its totient is φ = 214005226132.
The previous prime is 214005226129. The next prime is 214005226163. The reversal of 214005226133 is 331622500412.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 206972223364 + 7033002769 = 454942^2 + 83863^2 .
It is a cyclic number.
It is not a de Polignac number, because 214005226133 - 22 = 214005226129 is a prime.
It is a super-2 number, since 2×2140052261332 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 214005226096 and 214005226105.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (214005226163) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 107002613066 + 107002613067.
It is an arithmetic number, because the mean of its divisors is an integer number (107002613067).
Almost surely, 2214005226133 is an apocalyptic number.
It is an amenable number.
214005226133 is a deficient number, since it is larger than the sum of its proper divisors (1).
214005226133 is an equidigital number, since it uses as much as digits as its factorization.
214005226133 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8640, while the sum is 29.
Adding to 214005226133 its reverse (331622500412), we get a palindrome (545627726545).
The spelling of 214005226133 in words is "two hundred fourteen billion, five million, two hundred twenty-six thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •