Base | Representation |
---|---|
bin | 10111001100011101010000… |
… | …101100100010101110001011 |
3 | 111101012011112111100122202022 |
4 | 113030131100230202232023 |
5 | 101332322234224214011 |
6 | 1000543132412555055 |
7 | 30326026463015165 |
oct | 2714352054425613 |
9 | 441164474318668 |
10 | 102011122101131 |
11 | 2a55a746002181 |
12 | b536532482a8b |
13 | 44bc7b89b6039 |
14 | 1b29516877935 |
15 | bbd823e098db |
hex | 5cc750b22b8b |
102011122101131 has 32 divisors (see below), whose sum is σ = 115547802324480. Its totient is φ = 89548381440000.
The previous prime is 102011122101047. The next prime is 102011122101157. The reversal of 102011122101131 is 131101221110201.
It is a cyclic number.
It is not a de Polignac number, because 102011122101131 - 226 = 102011054992267 is a prime.
It is a super-2 number, since 2×1020111221011312 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 2520881 + ... + 14504381.
It is an arithmetic number, because the mean of its divisors is an integer number (3610868822640).
Almost surely, 2102011122101131 is an apocalyptic number.
102011122101131 is a deficient number, since it is larger than the sum of its proper divisors (13536680223349).
102011122101131 is a wasteful number, since it uses less digits than its factorization.
102011122101131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11984135.
The product of its (nonzero) digits is 24, while the sum is 17.
Adding to 102011122101131 its reverse (131101221110201), we get a palindrome (233112343211332).
The spelling of 102011122101131 in words is "one hundred two trillion, eleven billion, one hundred twenty-two million, one hundred one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •