Base | Representation |
---|---|
bin | 10110111111010001110101… |
… | …101101011101101001001011 |
3 | 111020222120222111000021100202 |
4 | 112333101311231131221023 |
5 | 101223003033240000021 |
6 | 555011121111322415 |
7 | 30203426444454431 |
oct | 2677216555355113 |
9 | 436876874007322 |
10 | 101105505000011 |
11 | 2a240670837156 |
12 | b40ab1108040b |
13 | 4455292595975 |
14 | 1ad7765474d51 |
15 | ba4ebd6cba0b |
hex | 5bf475b5da4b |
101105505000011 has 4 divisors (see below), whose sum is σ = 101105860465800. Its totient is φ = 101105149534224.
The previous prime is 101105504999981. The next prime is 101105505000023. The reversal of 101105505000011 is 110000505501101.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 101105505000011 - 234 = 101088325130827 is a prime.
It is a super-2 number, since 2×1011055050000112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101105505009011) 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 in 3 ways as a sum of consecutive naturals, for example, 177305906 + ... + 177875223.
It is an arithmetic number, because the mean of its divisors is an integer number (25276465116450).
Almost surely, 2101105505000011 is an apocalyptic number.
101105505000011 is a deficient number, since it is larger than the sum of its proper divisors (355465789).
101105505000011 is an equidigital number, since it uses as much as digits as its factorization.
101105505000011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 355465788.
The product of its (nonzero) digits is 125, while the sum is 20.
The spelling of 101105505000011 in words is "one hundred one trillion, one hundred five billion, five hundred five million, eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •