Base | Representation |
---|---|
bin | 1010000000010010100100… |
… | …0111001101001101101011 |
3 | 1102221121011221201000022202 |
4 | 2200010221013031031223 |
5 | 2420211201324000133 |
6 | 35221213204210415 |
7 | 2213505520522151 |
oct | 240045107151553 |
9 | 42847157630282 |
10 | 11000101000043 |
11 | 3561131273821 |
12 | 1297a87699a0b |
13 | 61a3c7327aac |
14 | 2a059cb473d1 |
15 | 1412104aa2e8 |
hex | a01291cd36b |
11000101000043 has 2 divisors, whose sum is σ = 11000101000044. Its totient is φ = 11000101000042.
The previous prime is 11000100999997. The next prime is 11000101000111. The reversal of 11000101000043 is 34000010100011.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 11000101000043 - 222 = 11000096805739 is a prime.
It is a super-2 number, since 2×110001010000432 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11000100999988 and 11000101000033.
It is not a weakly prime, because it can be changed into another prime (11000101005043) 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, 5500050500021 + 5500050500022.
It is an arithmetic number, because the mean of its divisors is an integer number (5500050500022).
Almost surely, 211000101000043 is an apocalyptic number.
11000101000043 is a deficient number, since it is larger than the sum of its proper divisors (1).
11000101000043 is an equidigital number, since it uses as much as digits as its factorization.
11000101000043 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12, while the sum is 11.
Adding to 11000101000043 its reverse (34000010100011), we get a palindrome (45000111100054).
The spelling of 11000101000043 in words is "eleven trillion, one hundred one million, forty-three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •