Base | Representation |
---|---|
bin | 111101000000110000… |
… | …1010011011011111111 |
3 | 110112012011000201221011 |
4 | 1322001201103123333 |
5 | 4121313113310421 |
6 | 140105104220051 |
7 | 12315563465446 |
oct | 1720141233377 |
9 | 415164021834 |
10 | 131022010111 |
11 | 50625566493 |
12 | 2148700a627 |
13 | c48084a045 |
14 | 64ad105d5d |
15 | 361c9414e1 |
hex | 1e818536ff |
131022010111 has 8 divisors (see below), whose sum is σ = 137945905920. Its totient is φ = 124100914392.
The previous prime is 131022010099. The next prime is 131022010159. The reversal of 131022010111 is 111010220131.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 131022010111 - 211 = 131022008063 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 131022010091 and 131022010100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131022070111) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 603625 + ... + 791458.
It is an arithmetic number, because the mean of its divisors is an integer number (17243238240).
Almost surely, 2131022010111 is an apocalyptic number.
131022010111 is a deficient number, since it is larger than the sum of its proper divisors (6923895809).
131022010111 is a wasteful number, since it uses less digits than its factorization.
131022010111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1400045.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 131022010111 its reverse (111010220131), we get a palindrome (242032230242).
The spelling of 131022010111 in words is "one hundred thirty-one billion, twenty-two million, ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •