Base | Representation |
---|---|
bin | 111011111100100… |
… | …0000110011101111 |
3 | 12012011212110000211 |
4 | 1313321000303233 |
5 | 13104411343343 |
6 | 531332003251 |
7 | 100562623501 |
oct | 16771006357 |
9 | 5164773024 |
10 | 2011434223 |
11 | 942447337 |
12 | 481760527 |
13 | 26094b986 |
14 | 1511d3d71 |
15 | bb8c079d |
hex | 77e40cef |
2011434223 has 2 divisors, whose sum is σ = 2011434224. Its totient is φ = 2011434222.
The previous prime is 2011434209. The next prime is 2011434253. The reversal of 2011434223 is 3224341102.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2011434223 is a prime.
It is a super-2 number, since 2×20114342232 = 8091735266911227458, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2011434194 and 2011434203.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2011434253) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1005717111 + 1005717112.
It is an arithmetic number, because the mean of its divisors is an integer number (1005717112).
Almost surely, 22011434223 is an apocalyptic number.
2011434223 is a deficient number, since it is larger than the sum of its proper divisors (1).
2011434223 is an equidigital number, since it uses as much as digits as its factorization.
2011434223 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 22.
The square root of 2011434223 is about 44849.0158531935. The cubic root of 2011434223 is about 1262.3175250831.
Adding to 2011434223 its reverse (3224341102), we get a palindrome (5235775325).
The spelling of 2011434223 in words is "two billion, eleven million, four hundred thirty-four thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •