Base | Representation |
---|---|
bin | 1001110010010… |
… | …0100111000111 |
3 | 2212020021100211 |
4 | 2130210213013 |
5 | 41001410143 |
6 | 4023420251 |
7 | 1005605020 |
oct | 234444707 |
9 | 85207324 |
10 | 41044423 |
11 | 21194312 |
12 | 118b4687 |
13 | 8671054 |
14 | 5645c47 |
15 | 390b49d |
hex | 27249c7 |
41044423 has 8 divisors (see below), whose sum is σ = 47180448. Its totient is φ = 34976544.
The previous prime is 41044417. The next prime is 41044441. The reversal of 41044423 is 32444014.
41044423 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 41044423 - 213 = 41036231 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 41044394 and 41044403.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (41044463) 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 7 ways as a sum of consecutive naturals, for example, 15736 + ... + 18157.
It is an arithmetic number, because the mean of its divisors is an integer number (5897556).
Almost surely, 241044423 is an apocalyptic number.
41044423 is a deficient number, since it is larger than the sum of its proper divisors (6136025).
41044423 is a wasteful number, since it uses less digits than its factorization.
41044423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34073.
The product of its (nonzero) digits is 1536, while the sum is 22.
The square root of 41044423 is about 6406.5921518386. The cubic root of 41044423 is about 344.9462157983.
Adding to 41044423 its reverse (32444014), we get a palindrome (73488437).
The spelling of 41044423 in words is "forty-one million, forty-four thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •