Base | Representation |
---|---|
bin | 1001110100111… |
… | …1100000100011 |
3 | 2212120012101112 |
4 | 2131033200203 |
5 | 41023021011 |
6 | 4031253535 |
7 | 1010236211 |
oct | 235174043 |
9 | 85505345 |
10 | 41220131 |
11 | 212a4327 |
12 | 1197a2ab |
13 | 8703014 |
14 | 568dcb1 |
15 | 394358b |
hex | 274f823 |
41220131 has 4 divisors (see below), whose sum is σ = 41493264. Its totient is φ = 40947000.
The previous prime is 41220103. The next prime is 41220133. The reversal of 41220131 is 13102214.
41220131 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 41220131 - 222 = 37025827 is a prime.
It is a super-2 number, since 2×412201312 = 3398198399314322, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (41220133) 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 3 ways as a sum of consecutive naturals, for example, 136340 + ... + 136641.
It is an arithmetic number, because the mean of its divisors is an integer number (10373316).
Almost surely, 241220131 is an apocalyptic number.
41220131 is a deficient number, since it is larger than the sum of its proper divisors (273133).
41220131 is a wasteful number, since it uses less digits than its factorization.
41220131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 273132.
The product of its (nonzero) digits is 48, while the sum is 14.
The square root of 41220131 is about 6420.2905697484. The cubic root of 41220131 is about 345.4377444213.
Adding to 41220131 its reverse (13102214), we get a palindrome (54322345).
The spelling of 41220131 in words is "forty-one million, two hundred twenty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •