Base | Representation |
---|---|
bin | 10010101010001100011101… |
… | …00000010011100100101100 |
3 | 12101021122022111120022211001 |
4 | 21111012032200103210230 |
5 | 20334232433113142030 |
6 | 223133534424010044 |
7 | 11433323333221156 |
oct | 1125061640234454 |
9 | 171248274508731 |
10 | 41032213412140 |
11 | 1208a733844325 |
12 | 4728399300924 |
13 | 19b8423674702 |
14 | a1bd80cd9ad6 |
15 | 4b251e577cca |
hex | 25518e81392c |
41032213412140 has 48 divisors (see below), whose sum is σ = 87173816581152. Its totient is φ = 16221942752256.
The previous prime is 41032213412023. The next prime is 41032213412161. The reversal of 41032213412140 is 4121431223014.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 41032213412099 and 41032213412108.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 21214179 + ... + 23067418.
It is an arithmetic number, because the mean of its divisors is an integer number (1816121178774).
Almost surely, 241032213412140 is an apocalyptic number.
It is an amenable number.
41032213412140 is an abundant number, since it is smaller than the sum of its proper divisors (46141603169012).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
41032213412140 is a wasteful number, since it uses less digits than its factorization.
41032213412140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44282146 (or 44282144 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 28.
Adding to 41032213412140 its reverse (4121431223014), we get a palindrome (45153644635154).
The spelling of 41032213412140 in words is "forty-one trillion, thirty-two billion, two hundred thirteen million, four hundred twelve thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.112 sec. • engine limits •