Base | Representation |
---|---|
bin | 10110111111001110110000… |
… | …101101111001000111110011 |
3 | 111020222021110011001221001101 |
4 | 112333032300231321013303 |
5 | 101222424301200013021 |
6 | 555005413125545231 |
7 | 30203251523442016 |
oct | 2677166055710763 |
9 | 436867404057041 |
10 | 101102200001011 |
11 | 2a23a225198520 |
12 | b40a34a275217 |
13 | 4454b86953161 |
14 | 1ad753055737d |
15 | ba4d7848ca91 |
hex | 5bf3b0b791f3 |
101102200001011 has 32 divisors (see below), whose sum is σ = 111006636182208. Its totient is φ = 91318769418240.
The previous prime is 101102200000981. The next prime is 101102200001029. The reversal of 101102200001011 is 110100002201101.
It is a cyclic number.
It is not a de Polignac number, because 101102200001011 - 27 = 101102200000883 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101102200001711) 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 31 ways as a sum of consecutive naturals, for example, 1894088755 + ... + 1894142131.
It is an arithmetic number, because the mean of its divisors is an integer number (3468957380694).
Almost surely, 2101102200001011 is an apocalyptic number.
101102200001011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
101102200001011 is a deficient number, since it is larger than the sum of its proper divisors (9904436181197).
101102200001011 is a wasteful number, since it uses less digits than its factorization.
101102200001011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55351.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 101102200001011 its reverse (110100002201101), we get a palindrome (211202202202112).
The spelling of 101102200001011 in words is "one hundred one trillion, one hundred two billion, two hundred million, one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •