Base | Representation |
---|---|
bin | 1001110011010… |
… | …1011001110000 |
3 | 2212100202201010 |
4 | 2130311121300 |
5 | 41011110300 |
6 | 4025110520 |
7 | 1006312362 |
oct | 234653160 |
9 | 85322633 |
10 | 41113200 |
11 | 21230a57 |
12 | 11928440 |
13 | 869644b |
14 | 5662d32 |
15 | 3921a50 |
hex | 2735670 |
41113200 has 60 divisors (see below), whose sum is σ = 131703128. Its totient is φ = 10963200.
The previous prime is 41113183. The next prime is 41113243. The reversal of 41113200 is 231114.
It is a happy number.
41113200 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (60).
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 15931 + ... + 18330.
Almost surely, 241113200 is an apocalyptic number.
41113200 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
41113200 is an abundant number, since it is smaller than the sum of its proper divisors (90589928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
41113200 is a wasteful number, since it uses less digits than its factorization.
41113200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34282 (or 34271 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 12.
The square root of 41113200 is about 6411.9575793980. The cubic root of 41113200 is about 345.1387805452.
Adding to 41113200 its reverse (231114), we get a palindrome (41344314).
The spelling of 41113200 in words is "forty-one million, one hundred thirteen thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •