Base | Representation |
---|---|
bin | 1001110001101… |
… | …1100001000001 |
3 | 2212011101021001 |
4 | 2130123201001 |
5 | 40444212134 |
6 | 4022532001 |
7 | 1005361300 |
oct | 234334101 |
9 | 85141231 |
10 | 41007169 |
11 | 21169325 |
12 | 11897001 |
13 | 865a0c8 |
14 | 5636437 |
15 | 3900414 |
hex | 271b841 |
41007169 has 6 divisors (see below), whose sum is σ = 47702274. Its totient is φ = 35148960.
The previous prime is 41007163. The next prime is 41007191. The reversal of 41007169 is 96170014.
It can be written as a sum of positive squares in only one way, i.e., 34656769 + 6350400 = 5887^2 + 2520^2 .
It is not a de Polignac number, because 41007169 - 29 = 41006657 is a prime.
It is a super-2 number, since 2×410071692 = 3363175818789122, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (41007163) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 418392 + ... + 418489.
It is an arithmetic number, because the mean of its divisors is an integer number (7950379).
Almost surely, 241007169 is an apocalyptic number.
41007169 is a gapful number since it is divisible by the number (49) formed by its first and last digit.
It is an amenable number.
41007169 is a deficient number, since it is larger than the sum of its proper divisors (6695105).
41007169 is an equidigital number, since it uses as much as digits as its factorization.
41007169 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 836895 (or 836888 counting only the distinct ones).
The product of its (nonzero) digits is 1512, while the sum is 28.
The square root of 41007169 is about 6403.6840178135. The cubic root of 41007169 is about 344.8418206470.
The spelling of 41007169 in words is "forty-one million, seven thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •