Base | Representation |
---|---|
bin | 110000000000000101011111… |
… | …110000101100010001001011 |
3 | 1000200111010022121101020011020 |
4 | 300000011133300230101023 |
5 | 210132330122312200133 |
6 | 2024555324152003523 |
7 | 62316230325601461 |
oct | 6000053760542113 |
9 | 1020433277336136 |
10 | 211112134100043 |
11 | 612a3176021310 |
12 | 1b816b426905a3 |
13 | 90a4a34079c07 |
14 | 3a1bc4b984831 |
15 | 196179ed920b3 |
hex | c0015fc2c44b |
211112134100043 has 32 divisors (see below), whose sum is σ = 307186674853632. Its totient is φ = 127899056937600.
The previous prime is 211112134100033. The next prime is 211112134100057. The reversal of 211112134100043 is 340001431211112.
It is not a de Polignac number, because 211112134100043 - 214 = 211112134083659 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 211112134099986 and 211112134100022.
It is not an unprimeable number, because it can be changed into a prime (211112134100033) 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 in 31 ways as a sum of consecutive naturals, for example, 996924153 + ... + 997135893.
It is an arithmetic number, because the mean of its divisors is an integer number (9599583589176).
Almost surely, 2211112134100043 is an apocalyptic number.
211112134100043 is a deficient number, since it is larger than the sum of its proper divisors (96074540753589).
211112134100043 is a wasteful number, since it uses less digits than its factorization.
211112134100043 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 222875.
The product of its (nonzero) digits is 576, while the sum is 24.
Adding to 211112134100043 its reverse (340001431211112), we get a palindrome (551113565311155).
The spelling of 211112134100043 in words is "two hundred eleven trillion, one hundred twelve billion, one hundred thirty-four million, one hundred thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •