Base | Representation |
---|---|
bin | 100110101001110110… |
… | …011101110101001101 |
3 | 10222010111201120121110 |
4 | 212221312131311031 |
5 | 1140000102130013 |
6 | 31022233522233 |
7 | 2666342003454 |
oct | 465166356515 |
9 | 128114646543 |
10 | 41504333133 |
11 | 1666912886a |
12 | 8063873379 |
13 | 3bb5930c03 |
14 | 201a2bbb9b |
15 | 112dada2c3 |
hex | 9a9d9dd4d |
41504333133 has 8 divisors (see below), whose sum is σ = 55340863200. Its totient is φ = 27668679248.
The previous prime is 41504333089. The next prime is 41504333177. The reversal of 41504333133 is 33133340514.
It is an interprime number because it is at equal distance from previous prime (41504333089) and next prime (41504333177).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 41504333133 - 218 = 41504070989 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 41504333133.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (41504333833) 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, 99138 + ... + 304691.
It is an arithmetic number, because the mean of its divisors is an integer number (6917607900).
Almost surely, 241504333133 is an apocalyptic number.
It is an amenable number.
41504333133 is a deficient number, since it is larger than the sum of its proper divisors (13836530067).
41504333133 is a wasteful number, since it uses less digits than its factorization.
41504333133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 438091.
The product of its (nonzero) digits is 19440, while the sum is 30.
Adding to 41504333133 its reverse (33133340514), we get a palindrome (74637673647).
The spelling of 41504333133 in words is "forty-one billion, five hundred four million, three hundred thirty-three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •