Base | Representation |
---|---|
bin | 1011000110001000100101… |
… | …0100111111001110111000 |
3 | 1121012022100202020210011011 |
4 | 2301202021110333032320 |
5 | 3044341110320213422 |
6 | 41540335134043304 |
7 | 2366264435223202 |
oct | 261421124771670 |
9 | 47168322223134 |
10 | 12200011101112 |
11 | 3983aa523847a |
12 | 145053b049534 |
13 | 6a65c10c7863 |
14 | 3026ab34d772 |
15 | 16253c339077 |
hex | b188953f3b8 |
12200011101112 has 8 divisors (see below), whose sum is σ = 22875020814600. Its totient is φ = 6100005550552.
The previous prime is 12200011101077. The next prime is 12200011101139. The reversal of 12200011101112 is 21110111000221.
It is a happy number.
12200011101112 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (8).
It is a junction number, because it is equal to n+sod(n) for n = 12200011101092 and 12200011101101.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 762500693812 + ... + 762500693827.
It is an arithmetic number, because the mean of its divisors is an integer number (2859377601825).
Almost surely, 212200011101112 is an apocalyptic number.
It is an amenable number.
12200011101112 is a deficient number, since it is larger than the sum of its proper divisors (10675009713488).
12200011101112 is a wasteful number, since it uses less digits than its factorization.
12200011101112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1525001387645 (or 1525001387641 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 12200011101112 its reverse (21110111000221), we get a palindrome (33310122101333).
The spelling of 12200011101112 in words is "twelve trillion, two hundred billion, eleven million, one hundred one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •