Base | Representation |
---|---|
bin | 101111000010010111… |
… | …1001110011010100011 |
3 | 100122201122102122111011 |
4 | 1132010233032122203 |
5 | 3123332333021011 |
6 | 114223125001351 |
7 | 10204103130103 |
oct | 1360457163243 |
9 | 318648378434 |
10 | 101011220131 |
11 | 39925222818 |
12 | 176b0553257 |
13 | 96aa177953 |
14 | 4c6348d203 |
15 | 2962dd5621 |
hex | 1784bce6a3 |
101011220131 has 4 divisors (see below), whose sum is σ = 101630921032. Its totient is φ = 100391519232.
The previous prime is 101011220087. The next prime is 101011220137. The reversal of 101011220131 is 131022110101.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 131022110101 = 523 ⋅250520287.
It is a cyclic number.
It is not a de Polignac number, because 101011220131 - 27 = 101011220003 is a prime.
It is a super-2 number, since 2×1010112201312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101011220137) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 309850206 + ... + 309850531.
It is an arithmetic number, because the mean of its divisors is an integer number (25407730258).
Almost surely, 2101011220131 is an apocalyptic number.
101011220131 is a deficient number, since it is larger than the sum of its proper divisors (619700901).
101011220131 is an equidigital number, since it uses as much as digits as its factorization.
101011220131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 619700900.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 101011220131 its reverse (131022110101), we get a palindrome (232033330232).
The spelling of 101011220131 in words is "one hundred one billion, eleven million, two hundred twenty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •