Base | Representation |
---|---|
bin | 1001110001110… |
… | …0111010010001 |
3 | 2212011200002121 |
4 | 2130130322101 |
5 | 40444403011 |
6 | 4023014241 |
7 | 1005414040 |
oct | 234347221 |
9 | 85150077 |
10 | 41012881 |
11 | 21172648 |
12 | 1189a381 |
13 | 865c8a0 |
14 | 5638557 |
15 | 3901e71 |
hex | 271ce91 |
41012881 has 8 divisors (see below), whose sum is σ = 50477504. Its totient is φ = 32449680.
The previous prime is 41012843. The next prime is 41012903. The reversal of 41012881 is 18821014.
41012881 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 41012881 - 221 = 38915729 is a prime.
It is a super-2 number, since 2×410128812 = 3364112815840322, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (41012821) 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, 225255 + ... + 225436.
It is an arithmetic number, because the mean of its divisors is an integer number (6309688).
Almost surely, 241012881 is an apocalyptic number.
It is an amenable number.
41012881 is a deficient number, since it is larger than the sum of its proper divisors (9464623).
41012881 is a wasteful number, since it uses less digits than its factorization.
41012881 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 450711.
The product of its (nonzero) digits is 512, while the sum is 25.
The square root of 41012881 is about 6404.1299955576. The cubic root of 41012881 is about 344.8578312217.
Adding to 41012881 its reverse (18821014), we get a palindrome (59833895).
The spelling of 41012881 in words is "forty-one million, twelve thousand, eight hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •