Base | Representation |
---|---|
bin | 11000000000000111011011… |
… | …111011111000010000010011 |
3 | 111211202112122122012221012001 |
4 | 120000013123323320100103 |
5 | 102314003113343003021 |
6 | 1012302033404014431 |
7 | 31143352330666315 |
oct | 3000073373702023 |
9 | 454675578187161 |
10 | 105561101141011 |
11 | 306a923669278a |
12 | ba0a547231417 |
13 | 46b94a4c75289 |
14 | 1c0d2825c97b5 |
15 | c30d46d86091 |
hex | 6001dbef8413 |
105561101141011 has 2 divisors, whose sum is σ = 105561101141012. Its totient is φ = 105561101141010.
The previous prime is 105561101140997. The next prime is 105561101141029. The reversal of 105561101141011 is 110141101165501.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 105561101141011 - 211 = 105561101138963 is a prime.
It is a super-2 number, since 2×1055611011410112 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (105561101141051) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52780550570505 + 52780550570506.
It is an arithmetic number, because the mean of its divisors is an integer number (52780550570506).
Almost surely, 2105561101141011 is an apocalyptic number.
105561101141011 is a deficient number, since it is larger than the sum of its proper divisors (1).
105561101141011 is an equidigital number, since it uses as much as digits as its factorization.
105561101141011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 600, while the sum is 28.
The spelling of 105561101141011 in words is "one hundred five trillion, five hundred sixty-one billion, one hundred one million, one hundred forty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •