Base | Representation |
---|---|
bin | 10110111111001100101110… |
… | …001100011110000000011000 |
3 | 111020222001210112120120022102 |
4 | 112333030232030132000120 |
5 | 101222410310102413422 |
6 | 555004411542542532 |
7 | 30203143333444526 |
oct | 2677145614360030 |
9 | 436861715516272 |
10 | 101100010201112 |
11 | 2a2393010a543a |
12 | b409a38a37a48 |
13 | 44548c8083480 |
14 | 1ad73a37b3316 |
15 | ba4c9b0d8192 |
hex | 5bf32e31e018 |
101100010201112 has 64 divisors (see below), whose sum is σ = 209092018581600. Its totient is φ = 45543403699200.
The previous prime is 101100010201061. The next prime is 101100010201121. The reversal of 101100010201112 is 211102010001101.
It is a junction number, because it is equal to n+sod(n) for n = 101100010201093 and 101100010201102.
It is a congruent number.
It is an unprimeable number.
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, 65796389 + ... + 67315412.
Almost surely, 2101100010201112 is an apocalyptic number.
It is an amenable number.
101100010201112 is an abundant number, since it is smaller than the sum of its proper divisors (107992008380488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101100010201112 is a wasteful number, since it uses less digits than its factorization.
101100010201112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 133111996 (or 133111992 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 101100010201112 its reverse (211102010001101), we get a palindrome (312202020202213).
The spelling of 101100010201112 in words is "one hundred one trillion, one hundred billion, ten million, two hundred one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •