Base | Representation |
---|---|
bin | 1111101001001… |
… | …00101110000001 |
3 | 100010220210021221 |
4 | 13310210232001 |
5 | 232043104101 |
6 | 21004315041 |
7 | 3152241412 |
oct | 764445601 |
9 | 303823257 |
10 | 131222401 |
11 | 68087372 |
12 | 37b42a81 |
13 | 21255cbb |
14 | 135db809 |
15 | b7c0aa1 |
hex | 7d24b81 |
131222401 has 8 divisors (see below), whose sum is σ = 133236360. Its totient is φ = 129220608.
The previous prime is 131222353. The next prime is 131222423. The reversal of 131222401 is 104222131.
It can be written as a sum of positive squares in 4 ways, for example, as 5760000 + 125462401 = 2400^2 + 11201^2 .
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 131222401 - 29 = 131221889 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (131222471) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 20005 + ... + 25741.
It is an arithmetic number, because the mean of its divisors is an integer number (16654545).
Almost surely, 2131222401 is an apocalyptic number.
It is an amenable number.
131222401 is a deficient number, since it is larger than the sum of its proper divisors (2013959).
131222401 is an equidigital number, since it uses as much as digits as its factorization.
131222401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6083.
The product of its (nonzero) digits is 96, while the sum is 16.
The square root of 131222401 is about 11455.2346549514. The cubic root of 131222401 is about 508.1625549287.
Adding to 131222401 its reverse (104222131), we get a palindrome (235444532).
The spelling of 131222401 in words is "one hundred thirty-one million, two hundred twenty-two thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •