Base | Representation |
---|---|
bin | 1011000111011010100010… |
… | …0111111110101111111011 |
3 | 1121021102010221221221201001 |
4 | 2301312220213332233323 |
5 | 3100221134304310133 |
6 | 41554414144305431 |
7 | 2401003553322322 |
oct | 261665047765773 |
9 | 47242127857631 |
10 | 12222011010043 |
11 | 399236465169a |
12 | 145485a912277 |
13 | 6a86b8c17253 |
14 | 3037970a90b9 |
15 | 162dc894a87d |
hex | b1da89febfb |
12222011010043 has 2 divisors, whose sum is σ = 12222011010044. Its totient is φ = 12222011010042.
The previous prime is 12222011010007. The next prime is 12222011010067. The reversal of 12222011010043 is 34001011022221.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 12222011010043 - 233 = 12213421075451 is a prime.
It is a super-2 number, since 2×122220110100432 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 12222011010043.
It is not a weakly prime, because it can be changed into another prime (12222011010073) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6111005505021 + 6111005505022.
It is an arithmetic number, because the mean of its divisors is an integer number (6111005505022).
Almost surely, 212222011010043 is an apocalyptic number.
12222011010043 is a deficient number, since it is larger than the sum of its proper divisors (1).
12222011010043 is an equidigital number, since it uses as much as digits as its factorization.
12222011010043 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 12222011010043 its reverse (34001011022221), we get a palindrome (46223022032264).
The spelling of 12222011010043 in words is "twelve trillion, two hundred twenty-two billion, eleven million, ten thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •