Base | Representation |
---|---|
bin | 11001000000101101100101… |
… | …100111001110101000010100 |
3 | 112102110220111221200010212111 |
4 | 121000231211213032220110 |
5 | 103404220212210401322 |
6 | 1025541204240400404 |
7 | 32112150216304063 |
oct | 3100554547165024 |
9 | 472426457603774 |
10 | 110000112200212 |
11 | 3205a870704943 |
12 | 10406913016104 |
13 | 494bc735c7110 |
14 | 1d24068bca1da |
15 | cab54e4c7177 |
hex | 640b659cea14 |
110000112200212 has 24 divisors (see below), whose sum is σ = 207308225587176. Its totient is φ = 50769203739648.
The previous prime is 110000112200189. The next prime is 110000112200227. The reversal of 110000112200212 is 212002211000011.
It can be written as a sum of positive squares in 4 ways, for example, as 26270914266256 + 83729197933956 = 5125516^2 + 9150366^2 .
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a junction number, because it is equal to n+sod(n) for n = 110000112200192 and 110000112200201.
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, 44555568 + ... + 46959544.
It is an arithmetic number, because the mean of its divisors is an integer number (8637842732799).
Almost surely, 2110000112200212 is an apocalyptic number.
It is an amenable number.
110000112200212 is a deficient number, since it is larger than the sum of its proper divisors (97308113386964).
110000112200212 is a wasteful number, since it uses less digits than its factorization.
110000112200212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3283947 (or 3283945 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 110000112200212 its reverse (212002211000011), we get a palindrome (322002323200223).
The spelling of 110000112200212 in words is "one hundred ten trillion, one hundred twelve million, two hundred thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •