Base | Representation |
---|---|
bin | 111101000000001000… |
… | …1100011001011111101 |
3 | 110112010200200112220110 |
4 | 1322000101203023331 |
5 | 4121242240244401 |
6 | 140103040140233 |
7 | 12315221001201 |
oct | 1720021431375 |
9 | 415120615813 |
10 | 131001103101 |
11 | 50614786770 |
12 | 21480007679 |
13 | c479409b2b |
14 | 64aa422b01 |
15 | 361abb19d6 |
hex | 1e804632fd |
131001103101 has 8 divisors (see below), whose sum is σ = 190547059104. Its totient is φ = 79394607920.
The previous prime is 131001103067. The next prime is 131001103109. The reversal of 131001103101 is 101301100131.
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 131001103101 - 223 = 130992714493 is a prime.
It is a super-2 number, since 2×1310011031012 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131001103109) 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, 1984865166 + ... + 1984865231.
It is an arithmetic number, because the mean of its divisors is an integer number (23818382388).
Almost surely, 2131001103101 is an apocalyptic number.
131001103101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
131001103101 is a deficient number, since it is larger than the sum of its proper divisors (59545956003).
131001103101 is a wasteful number, since it uses less digits than its factorization.
131001103101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3969730411.
The product of its (nonzero) digits is 9, while the sum is 12.
Adding to 131001103101 its reverse (101301100131), we get a palindrome (232302203232).
The spelling of 131001103101 in words is "one hundred thirty-one billion, one million, one hundred three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •