Base | Representation |
---|---|
bin | 10111000000111100100100… |
… | …110100111001011001110010 |
3 | 111021101112210122111202012020 |
4 | 113000330210310321121302 |
5 | 101231342242200024333 |
6 | 555135513315412310 |
7 | 30214624511026122 |
oct | 2700744464713162 |
9 | 437345718452166 |
10 | 101220112111218 |
11 | 2a285232536091 |
12 | b4291768b4096 |
13 | 44630283cc879 |
14 | 1add118486c82 |
15 | ba7e79ebe3b3 |
hex | 5c0f24d39672 |
101220112111218 has 32 divisors (see below), whose sum is σ = 203740332675264. Its totient is φ = 33524046021312.
The previous prime is 101220112111087. The next prime is 101220112111219. The reversal of 101220112111218 is 812111211022101.
It is a super-2 number, since 2×1012201121112182 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (101220112111219) by changing a digit.
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, 86089905 + ... + 87257732.
It is an arithmetic number, because the mean of its divisors is an integer number (6366885396102).
Almost surely, 2101220112111218 is an apocalyptic number.
101220112111218 is an abundant number, since it is smaller than the sum of its proper divisors (102520220564046).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101220112111218 is a wasteful number, since it uses less digits than its factorization.
101220112111218 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 173348266.
The product of its (nonzero) digits is 128, while the sum is 24.
Adding to 101220112111218 its reverse (812111211022101), we get a palindrome (913331323133319).
The spelling of 101220112111218 in words is "one hundred one trillion, two hundred twenty billion, one hundred twelve million, one hundred eleven thousand, two hundred eighteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •