Base | Representation |
---|---|
bin | 10110111111001100110100… |
… | …001001010000011000111001 |
3 | 111020222002001111102000002210 |
4 | 112333030310021100120321 |
5 | 101222411011131202301 |
6 | 555004425510245333 |
7 | 30203145655063233 |
oct | 2677146411203071 |
9 | 436862044360083 |
10 | 101100110022201 |
11 | 2a239352484504 |
12 | b409a66356849 |
13 | 44549129636c4 |
14 | 1ad73b2b59253 |
15 | ba4ca4c54ad6 |
hex | 5bf334250639 |
101100110022201 has 16 divisors (see below), whose sum is σ = 142760440894464. Its totient is φ = 63507402009744.
The previous prime is 101100110022137. The next prime is 101100110022211. The reversal of 101100110022201 is 102220011001101.
It is not a de Polignac number, because 101100110022201 - 26 = 101100110022137 is a prime.
It is a super-2 number, since 2×1011001100222012 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (101100110022211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10934465421 + ... + 10934474666.
It is an arithmetic number, because the mean of its divisors is an integer number (8922527555904).
Almost surely, 2101100110022201 is an apocalyptic number.
It is an amenable number.
101100110022201 is a deficient number, since it is larger than the sum of its proper divisors (41660330872263).
101100110022201 is a wasteful number, since it uses less digits than its factorization.
101100110022201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21868940180.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 101100110022201 its reverse (102220011001101), we get a palindrome (203320121023302).
The spelling of 101100110022201 in words is "one hundred one trillion, one hundred billion, one hundred ten million, twenty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •