Base | Representation |
---|---|
bin | 10111000000110100001100… |
… | …010101001110001110010000 |
3 | 111021100200120100202002210222 |
4 | 113000310030111032032100 |
5 | 101231220323433020422 |
6 | 555131424223212212 |
7 | 30214155454514105 |
oct | 2700641425161620 |
9 | 437320510662728 |
10 | 101211111220112 |
11 | 2a281433796403 |
12 | b427484447068 |
13 | 44622226c9aba |
14 | 1adc902cbcaac |
15 | ba7aeebb8842 |
hex | 5c0d0c54e390 |
101211111220112 has 80 divisors (see below), whose sum is σ = 199577497286640. Its totient is φ = 49709500416000.
The previous prime is 101211111220111. The next prime is 101211111220117. The reversal of 101211111220112 is 211022111112101.
It can be written as a sum of positive squares in 8 ways, for example, as 3181785467536 + 98029325752576 = 1783756^2 + 9900976^2 .
It is not an unprimeable number, because it can be changed into a prime (101211111220111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2448654998 + ... + 2448696330.
It is an arithmetic number, because the mean of its divisors is an integer number (2494718716083).
Almost surely, 2101211111220112 is an apocalyptic number.
It is an amenable number.
101211111220112 is a deficient number, since it is larger than the sum of its proper divisors (98366386066528).
101211111220112 is a wasteful number, since it uses less digits than its factorization.
101211111220112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44692 (or 44686 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 17.
Adding to 101211111220112 its reverse (211022111112101), we get a palindrome (312233222332213).
The spelling of 101211111220112 in words is "one hundred one trillion, two hundred eleven billion, one hundred eleven million, two hundred twenty thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •