Base | Representation |
---|---|
bin | 1111101001101… |
… | …11111110110101 |
3 | 100011001210112011 |
4 | 13310313332311 |
5 | 232103120201 |
6 | 21010124221 |
7 | 3153020425 |
oct | 764677665 |
9 | 304053464 |
10 | 131301301 |
11 | 6813067a |
12 | 37b80671 |
13 | 21282ba1 |
14 | 1361c485 |
15 | b7d9151 |
hex | 7d37fb5 |
131301301 has 4 divisors (see below), whose sum is σ = 131337612. Its totient is φ = 131264992.
The previous prime is 131301283. The next prime is 131301323. The reversal of 131301301 is 103103131.
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: 103103131 = 593 ⋅173867.
It can be written as a sum of positive squares in 2 ways, for example, as 77264100 + 54037201 = 8790^2 + 7351^2 .
It is a cyclic number.
It is not a de Polignac number, because 131301301 - 29 = 131300789 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131301361) 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, 12046 + ... + 20191.
It is an arithmetic number, because the mean of its divisors is an integer number (32834403).
Almost surely, 2131301301 is an apocalyptic number.
It is an amenable number.
131301301 is a deficient number, since it is larger than the sum of its proper divisors (36311).
131301301 is an equidigital number, since it uses as much as digits as its factorization.
131301301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 36310.
The product of its (nonzero) digits is 27, while the sum is 13.
The square root of 131301301 is about 11458.6779778472. The cubic root of 131301301 is about 508.2643820360.
Adding to 131301301 its reverse (103103131), we get a palindrome (234404432).
The spelling of 131301301 in words is "one hundred thirty-one million, three hundred one thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •