Base | Representation |
---|---|
bin | 10110110000101010011011… |
… | …001111000101000110011111 |
3 | 111010102120110121210121102221 |
4 | 112300222123033011012133 |
5 | 101110024034212101421 |
6 | 552521452140330211 |
7 | 30041031606636640 |
oct | 2660523317050637 |
9 | 433376417717387 |
10 | 100101112222111 |
11 | 29993709245200 |
12 | b288323b43967 |
13 | 43b16571c5480 |
14 | 1aa0cc38736c7 |
15 | b88cd64a6841 |
hex | 5b0a9b3c519f |
100101112222111 has 48 divisors (see below), whose sum is σ = 136760476958784. Its totient is φ = 71287920000000.
The previous prime is 100101112222091. The next prime is 100101112222117. The reversal of 100101112222111 is 111222211101001.
It is not a de Polignac number, because 100101112222111 - 213 = 100101112213919 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100101112222117) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 43892890 + ... + 46117111.
It is an arithmetic number, because the mean of its divisors is an integer number (2849176603308).
Almost surely, 2100101112222111 is an apocalyptic number.
100101112222111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
100101112222111 is a deficient number, since it is larger than the sum of its proper divisors (36659364736673).
100101112222111 is a wasteful number, since it uses less digits than its factorization.
100101112222111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 90010144 (or 90010133 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 100101112222111 its reverse (111222211101001), we get a palindrome (211323323323112).
The spelling of 100101112222111 in words is "one hundred trillion, one hundred one billion, one hundred twelve million, two hundred twenty-two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •