Base | Representation |
---|---|
bin | 100110011010010010… |
… | …110010011100010100 |
3 | 10221110022120211211100 |
4 | 212122102302130110 |
5 | 1133431242302012 |
6 | 30540311310100 |
7 | 2660022311445 |
oct | 463222623424 |
9 | 127408524740 |
10 | 41243322132 |
11 | 165448643a1 |
12 | 7bb037b330 |
13 | 3b7383472c |
14 | 1dd37772cc |
15 | 1115c2d8dc |
hex | 99a4b2714 |
41243322132 has 36 divisors (see below), whose sum is σ = 104302932916. Its totient is φ = 13741315200.
The previous prime is 41243322121. The next prime is 41243322187. The reversal of 41243322132 is 23122334214.
41243322132 is a `hidden beast` number, since 4 + 1 + 2 + 433 + 221 + 3 + 2 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 19680161796 + 21563160336 = 140286^2 + 146844^2 .
It is a tau number, because it is divible by the number of its divisors (36).
It is a nude number because it is divisible by every one of its digits.
It is a junction number, because it is equal to n+sod(n) for n = 41243322096 and 41243322105.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 191119 + ... + 344982.
Almost surely, 241243322132 is an apocalyptic number.
It is an amenable number.
41243322132 is an abundant number, since it is smaller than the sum of its proper divisors (63059610784).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
41243322132 is a wasteful number, since it uses less digits than its factorization.
41243322132 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 538248 (or 538243 counting only the distinct ones).
The product of its digits is 6912, while the sum is 27.
Adding to 41243322132 its reverse (23122334214), we get a palindrome (64365656346).
The spelling of 41243322132 in words is "forty-one billion, two hundred forty-three million, three hundred twenty-two thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •