Base | Representation |
---|---|
bin | 1001110011000… |
… | …0100100111011 |
3 | 2212022202121002 |
4 | 2130300210323 |
5 | 41004442220 |
6 | 4024435215 |
7 | 1006200635 |
oct | 234604473 |
9 | 85282532 |
10 | 41093435 |
11 | 21218119 |
12 | 11918b0b |
13 | 868a456 |
14 | 5659a55 |
15 | 391ac75 |
hex | 273093b |
41093435 has 8 divisors (see below), whose sum is σ = 51012720. Its totient is φ = 31741024.
The previous prime is 41093431. The next prime is 41093461. The reversal of 41093435 is 53439014.
41093435 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 41093435 - 22 = 41093431 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (29).
It is a junction number, because it is equal to n+sod(n) for n = 41093398 and 41093407.
It is not an unprimeable number, because it can be changed into a prime (41093431) 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, 141557 + ... + 141846.
It is an arithmetic number, because the mean of its divisors is an integer number (6376590).
Almost surely, 241093435 is an apocalyptic number.
41093435 is a deficient number, since it is larger than the sum of its proper divisors (9919285).
41093435 is a wasteful number, since it uses less digits than its factorization.
41093435 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 283437.
The product of its (nonzero) digits is 6480, while the sum is 29.
The square root of 41093435 is about 6410.4161331383. The cubic root of 41093435 is about 345.0834636685.
The spelling of 41093435 in words is "forty-one million, ninety-three thousand, four hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •