Base | Representation |
---|---|
bin | 10010110010111001001101… |
… | …10010011001001110100000 |
3 | 12102100012211212222210122212 |
4 | 21121130212302121032200 |
5 | 20404132113441043034 |
6 | 223523131015421252 |
7 | 11464034465124164 |
oct | 1131344662311640 |
9 | 172305755883585 |
10 | 41331121034144 |
11 | 12195480361897 |
12 | 47762b8984828 |
13 | 1a0a67b0909b6 |
14 | a2c618d24ca4 |
15 | 4ba1b5da92ce |
hex | 259726c993a0 |
41331121034144 has 48 divisors (see below), whose sum is σ = 83366588861640. Its totient is φ = 20158790615040.
The previous prime is 41331121034131. The next prime is 41331121034173. The reversal of 41331121034144 is 44143012113314.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 11175515280400 + 30155605753744 = 3342980^2 + 5491412^2 .
It is a Harshad number since it is a multiple of its sum of digits (32).
It is a self number, because there is not a number n which added to its sum of digits gives 41331121034144.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7569062 + ... + 11830170.
Almost surely, 241331121034144 is an apocalyptic number.
It is an amenable number.
41331121034144 is an abundant number, since it is smaller than the sum of its proper divisors (42035467827496).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
41331121034144 is a wasteful number, since it uses less digits than its factorization.
41331121034144 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4268553 (or 4268545 counting only the distinct ones).
The product of its (nonzero) digits is 13824, while the sum is 32.
Adding to 41331121034144 its reverse (44143012113314), we get a palindrome (85474133147458).
The spelling of 41331121034144 in words is "forty-one trillion, three hundred thirty-one billion, one hundred twenty-one million, thirty-four thousand, one hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •