Base | Representation |
---|---|
bin | 10110111111001100101101… |
… | …101001110000010110011100 |
3 | 111020222001202220110020121002 |
4 | 112333030231221300112130 |
5 | 101222410300240214322 |
6 | 555004411015525432 |
7 | 30203143163214311 |
oct | 2677145551602634 |
9 | 436861686406532 |
10 | 101100001101212 |
11 | 2a2392a6a4a563 |
12 | b409a35989878 |
13 | 44548c6218509 |
14 | 1ad73a24c4d08 |
15 | ba4c9a3dbc92 |
hex | 5bf32da7059c |
101100001101212 has 24 divisors (see below), whose sum is σ = 177388300417440. Its totient is φ = 50417654886720.
The previous prime is 101100001101181. The next prime is 101100001101233. The reversal of 101100001101212 is 212101100001101.
It is a super-2 number, since 2×1011000011012122 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 101100001101193 and 101100001101202.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 12828137 + ... + 19151007.
It is an arithmetic number, because the mean of its divisors is an integer number (7391179184060).
Almost surely, 2101100001101212 is an apocalyptic number.
It is an amenable number.
101100001101212 is a deficient number, since it is larger than the sum of its proper divisors (76288299316228).
101100001101212 is a wasteful number, since it uses less digits than its factorization.
101100001101212 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6333341 (or 6333339 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 101100001101212 its reverse (212101100001101), we get a palindrome (313201101102313).
It can be divided in two parts, 101100001101 and 212, that multiplied together give a palindrome (21433200233412).
The spelling of 101100001101212 in words is "one hundred one trillion, one hundred billion, one million, one hundred one thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •