Base | Representation |
---|---|
bin | 10010101111110100010111… |
… | …10101101110100000000011 |
3 | 12101222010001221200000120101 |
4 | 21113322023311232200003 |
5 | 20400414201202133011 |
6 | 223402412352023231 |
7 | 11453303614063234 |
oct | 1127721365564003 |
9 | 171863057600511 |
10 | 41225442224131 |
11 | 12154680432780 |
12 | 4759925231b17 |
13 | 1a00708bc2259 |
14 | a274719c308b |
15 | 4b757d32e2c1 |
hex | 257e8bd6e803 |
41225442224131 has 4 divisors (see below), whose sum is σ = 44973209699064. Its totient is φ = 37477674749200.
The previous prime is 41225442224123. The next prime is 41225442224137. The reversal of 41225442224131 is 13142224452214.
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 41225442224131 - 23 = 41225442224123 is a prime.
It is a super-2 number, since 2×412254422241312 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (41225442224137) 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, 1873883737450 + ... + 1873883737471.
It is an arithmetic number, because the mean of its divisors is an integer number (11243302424766).
Almost surely, 241225442224131 is an apocalyptic number.
41225442224131 is a deficient number, since it is larger than the sum of its proper divisors (3747767474933).
41225442224131 is a wasteful number, since it uses less digits than its factorization.
41225442224131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3747767474932.
The product of its digits is 122880, while the sum is 37.
Adding to 41225442224131 its reverse (13142224452214), we get a palindrome (54367666676345).
The spelling of 41225442224131 in words is "forty-one trillion, two hundred twenty-five billion, four hundred forty-two million, two hundred twenty-four thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •