Base | Representation |
---|---|
bin | 10110111111001100101110… |
… | …010011011000000111101001 |
3 | 111020222001210122222120101200 |
4 | 112333030232103120013221 |
5 | 101222410311033341014 |
6 | 555004412045434413 |
7 | 30203143355026233 |
oct | 2677145623300751 |
9 | 436861718876350 |
10 | 101100012012009 |
11 | 2a239302121a4a |
12 | b409a3956ba09 |
13 | 44548c85687ca |
14 | 1ad73a3b25253 |
15 | ba4c9b344a09 |
hex | 5bf32e4d81e9 |
101100012012009 has 12 divisors (see below), whose sum is σ = 148788696924036. Its totient is φ = 66128309743392.
The previous prime is 101100012012001. The next prime is 101100012012019. The reversal of 101100012012009 is 900210210001101.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 58583287376784 + 42516724635225 = 7653972^2 + 6520485^2 .
It is not a de Polignac number, because 101100012012009 - 23 = 101100012012001 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101100012011982 and 101100012012000.
It is not an unprimeable number, because it can be changed into a prime (101100012012001) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 105974854882 + ... + 105974855835.
It is an arithmetic number, because the mean of its divisors is an integer number (12399058077003).
Almost surely, 2101100012012009 is an apocalyptic number.
It is an amenable number.
101100012012009 is a deficient number, since it is larger than the sum of its proper divisors (47688684912027).
101100012012009 is a wasteful number, since it uses less digits than its factorization.
101100012012009 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 211949710776 (or 211949710773 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 18.
The spelling of 101100012012009 in words is "one hundred one trillion, one hundred billion, twelve million, twelve thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •