Base | Representation |
---|---|
bin | 1010000000011… |
… | …0000111111101 |
3 | 2220222012110000 |
4 | 2200012013331 |
5 | 41220440000 |
6 | 4055304513 |
7 | 1016503023 |
oct | 240060775 |
9 | 86865400 |
10 | 41968125 |
11 | 21765301 |
12 | 1207b139 |
13 | 8905614 |
14 | 5806713 |
15 | 3a40000 |
hex | 28061fd |
41968125 has 50 divisors (see below), whose sum is σ = 78435830. Its totient is φ = 22356000.
The previous prime is 41968109. The next prime is 41968127. The reversal of 41968125 is 52186914.
It can be written as a sum of positive squares in 5 ways, for example, as 14907321 + 27060804 = 3861^2 + 5202^2 .
It is not a de Polignac number, because 41968125 - 24 = 41968109 is a prime.
It is a super-2 number, since 2×419681252 = 3522647032031250, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 41968125.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (41968127) by changing a digit.
It is a polite number, since it can be written in 49 ways as a sum of consecutive naturals, for example, 50211 + ... + 51039.
Almost surely, 241968125 is an apocalyptic number.
41968125 is a gapful number since it is divisible by the number (45) formed by its first and last digit.
It is an amenable number.
41968125 is a deficient number, since it is larger than the sum of its proper divisors (36467705).
41968125 is an frugal number, since it uses more digits than its factorization.
41968125 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 861 (or 837 counting only the distinct ones).
The product of its digits is 17280, while the sum is 36.
The square root of 41968125 is about 6478.2810219996. The cubic root of 41968125 is about 347.5147070359.
It can be divided in two parts, 4196 and 8125, that added together give a palindrome (12321).
The spelling of 41968125 in words is "forty-one million, nine hundred sixty-eight thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •