Base | Representation |
---|---|
bin | 10010110010111001100011… |
… | …00110011000000101101100 |
3 | 12102100020022112022211021220 |
4 | 21121130301212120011230 |
5 | 20404133001410330012 |
6 | 223523201015423340 |
7 | 11464042130030205 |
oct | 1131346146300554 |
9 | 172306275284256 |
10 | 41331302433132 |
11 | 1219556379a608 |
12 | 4776349684b50 |
13 | 1a0a6a983458a |
14 | a2c6350645ac |
15 | 4ba1c6c8c08c |
hex | 25973199816c |
41331302433132 has 24 divisors (see below), whose sum is σ = 96716037222000. Its totient is φ = 13737624876096.
The previous prime is 41331302433131. The next prime is 41331302433143. The reversal of 41331302433132 is 23133420313314.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 41331302433093 and 41331302433102.
It is not an unprimeable number, because it can be changed into a prime (41331302433131) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4934487507 + ... + 4934495882.
It is an arithmetic number, because the mean of its divisors is an integer number (4029834884250).
Almost surely, 241331302433132 is an apocalyptic number.
It is an amenable number.
41331302433132 is an abundant number, since it is smaller than the sum of its proper divisors (55384734788868).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
41331302433132 is a wasteful number, since it uses less digits than its factorization.
41331302433132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9868983745 (or 9868983743 counting only the distinct ones).
The product of its (nonzero) digits is 46656, while the sum is 33.
Adding to 41331302433132 its reverse (23133420313314), we get a palindrome (64464722746446).
The spelling of 41331302433132 in words is "forty-one trillion, three hundred thirty-one billion, three hundred two million, four hundred thirty-three thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •