Base | Representation |
---|---|
bin | 111110000011110… |
… | …111110001000001 |
3 | 2200120012112221222 |
4 | 332003313301001 |
5 | 4113021432431 |
6 | 251152324425 |
7 | 34542034022 |
oct | 7603676101 |
9 | 2616175858 |
10 | 1041202241 |
11 | 494805722 |
12 | 250843715 |
13 | 137935001 |
14 | 9c3d4c49 |
15 | 6161e57b |
hex | 3e0f7c41 |
1041202241 has 4 divisors (see below), whose sum is σ = 1041327300. Its totient is φ = 1041077184.
The previous prime is 1041202231. The next prime is 1041202243. The reversal of 1041202241 is 1422021401.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 1422021401 = 1091 ⋅1303411.
It can be written as a sum of positive squares in 2 ways, for example, as 579124225 + 462078016 = 24065^2 + 21496^2 .
It is a cyclic number.
It is not a de Polignac number, because 1041202241 - 218 = 1040940097 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1041202243) 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, 49076 + ... + 67013.
It is an arithmetic number, because the mean of its divisors is an integer number (260331825).
Almost surely, 21041202241 is an apocalyptic number.
It is an amenable number.
1041202241 is a deficient number, since it is larger than the sum of its proper divisors (125059).
1041202241 is an equidigital number, since it uses as much as digits as its factorization.
1041202241 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 125058.
The product of its (nonzero) digits is 128, while the sum is 17.
The square root of 1041202241 is about 32267.6655647724. The cubic root of 1041202241 is about 1013.5496578958.
Adding to 1041202241 its reverse (1422021401), we get a palindrome (2463223642).
The spelling of 1041202241 in words is "one billion, forty-one million, two hundred two thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •