Base | Representation |
---|---|
bin | 1001110101100… |
… | …0001100010111 |
3 | 2212122000012000 |
4 | 2131120030113 |
5 | 41030140303 |
6 | 4032130343 |
7 | 1010445006 |
oct | 235301427 |
9 | 85560160 |
10 | 41255703 |
11 | 21319025 |
12 | 119969b3 |
13 | 8716278 |
14 | 569cc3d |
15 | 394dda3 |
hex | 2758317 |
41255703 has 32 divisors (see below), whose sum is σ = 63894720. Its totient is φ = 26282880.
The previous prime is 41255693. The next prime is 41255713. The reversal of 41255703 is 30755214.
It is a happy number.
41255703 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (41255693) and next prime (41255713).
It is not a de Polignac number, because 41255703 - 25 = 41255671 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (41255713) 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 31 ways as a sum of consecutive naturals, for example, 60601 + ... + 61277.
It is an arithmetic number, because the mean of its divisors is an integer number (1996710).
Almost surely, 241255703 is an apocalyptic number.
41255703 is a deficient number, since it is larger than the sum of its proper divisors (22639017).
41255703 is a wasteful number, since it uses less digits than its factorization.
41255703 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 784 (or 778 counting only the distinct ones).
The product of its (nonzero) digits is 4200, while the sum is 27.
The square root of 41255703 is about 6423.0602519360. The cubic root of 41255703 is about 345.5370840572.
The spelling of 41255703 in words is "forty-one million, two hundred fifty-five thousand, seven hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •