Base | Representation |
---|---|
bin | 100110001110011010… |
… | …110101000001000001 |
3 | 10220221102201110212121 |
4 | 212032122311001001 |
5 | 1133024242300413 |
6 | 30504433324241 |
7 | 2652053056360 |
oct | 461632650101 |
9 | 126842643777 |
10 | 41044103233 |
11 | 16452365281 |
12 | 7b55706681 |
13 | 3b41491b23 |
14 | 1db51197d7 |
15 | 11034cab8d |
hex | 98e6b5041 |
41044103233 has 4 divisors (see below), whose sum is σ = 46907546560. Its totient is φ = 35180659908.
The previous prime is 41044103201. The next prime is 41044103291. The reversal of 41044103233 is 33230144014.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 41044103233 - 25 = 41044103201 is a prime.
It is a super-2 number, since 2×410441032332 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 41044103198 and 41044103207.
It is not an unprimeable number, because it can be changed into a prime (41044103533) 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, 2931721653 + ... + 2931721666.
It is an arithmetic number, because the mean of its divisors is an integer number (11726886640).
Almost surely, 241044103233 is an apocalyptic number.
It is an amenable number.
41044103233 is a deficient number, since it is larger than the sum of its proper divisors (5863443327).
41044103233 is an equidigital number, since it uses as much as digits as its factorization.
41044103233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5863443326.
The product of its (nonzero) digits is 3456, while the sum is 25.
Adding to 41044103233 its reverse (33230144014), we get a palindrome (74274247247).
The spelling of 41044103233 in words is "forty-one billion, forty-four million, one hundred three thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •