Base | Representation |
---|---|
bin | 101111000101101001… |
… | …0110000111111101101 |
3 | 100200000022101012122200 |
4 | 1132023102300333231 |
5 | 3124044011400414 |
6 | 114242054132113 |
7 | 10206610006326 |
oct | 1361322607755 |
9 | 320008335580 |
10 | 101121200109 |
11 | 39981310366 |
12 | 17721351039 |
13 | 96c6ba3b67 |
14 | 4c73d1b44d |
15 | 296c8ac109 |
hex | 178b4b0fed |
101121200109 has 6 divisors (see below), whose sum is σ = 146063955726. Its totient is φ = 67414133400.
The previous prime is 101121200099. The next prime is 101121200123. The reversal of 101121200109 is 901002121101.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 69925869225 + 31195330884 = 264435^2 + 176622^2 .
It is not a de Polignac number, because 101121200109 - 25 = 101121200077 is a prime.
It is a super-2 number, since 2×1011212001092 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 101121200091 and 101121200100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101121200129) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 5617844442 + ... + 5617844459.
It is an arithmetic number, because the mean of its divisors is an integer number (24343992621).
Almost surely, 2101121200109 is an apocalyptic number.
It is an amenable number.
101121200109 is a deficient number, since it is larger than the sum of its proper divisors (44942755617).
101121200109 is a wasteful number, since it uses less digits than its factorization.
101121200109 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11235688907 (or 11235688904 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 18.
The spelling of 101121200109 in words is "one hundred one billion, one hundred twenty-one million, two hundred thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •