Base | Representation |
---|---|
bin | 10010110100001101001100… |
… | …00111111000111000100100 |
3 | 12102111112020000021121212100 |
4 | 21122012212013320320210 |
5 | 20410401433001020403 |
6 | 223555544521252100 |
7 | 11500221660664323 |
oct | 1132064607707044 |
9 | 172445200247770 |
10 | 41376207048228 |
11 | 12202607226558 |
12 | 4782ba0034030 |
13 | 1a119b4a59740 |
14 | a30894b840ba |
15 | 4bb4541382a3 |
hex | 25a1a61f8e24 |
41376207048228 has 144 divisors (see below), whose sum is σ = 117581808314880. Its totient is φ = 12172495027968.
The previous prime is 41376207048173. The next prime is 41376207048271. The reversal of 41376207048228 is 82284070267314.
41376207048228 is a `hidden beast` number, since 4 + 1 + 3 + 7 + 620 + 7 + 0 + 4 + 8 + 2 + 2 + 8 = 666.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 24844078 + ... + 26457146.
It is an arithmetic number, because the mean of its divisors is an integer number (816540335520).
Almost surely, 241376207048228 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 41376207048228, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (58790904157440).
41376207048228 is an abundant number, since it is smaller than the sum of its proper divisors (76205601266652).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
41376207048228 is a wasteful number, since it uses less digits than its factorization.
41376207048228 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1615498 (or 1615493 counting only the distinct ones).
The product of its (nonzero) digits is 7225344, while the sum is 54.
The spelling of 41376207048228 in words is "forty-one trillion, three hundred seventy-six billion, two hundred seven million, forty-eight thousand, two hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •