Base | Representation |
---|---|
bin | 100110101100001011… |
… | …111111011001000010 |
3 | 10222020020110222200010 |
4 | 212230023333121002 |
5 | 1140040120430200 |
6 | 31030154005350 |
7 | 3000326115261 |
oct | 465413773102 |
9 | 128206428603 |
10 | 41543530050 |
11 | 16689270010 |
12 | 8074a16856 |
13 | 3bc0aa6059 |
14 | 20215a25d8 |
15 | 113227e150 |
hex | 9ac2ff642 |
41543530050 has 96 divisors (see below), whose sum is σ = 112456802304. Its totient is φ = 10065544000.
The previous prime is 41543530019. The next prime is 41543530081. The reversal of 41543530050 is 5003534514.
It is an interprime number because it is at equal distance from previous prime (41543530019) and next prime (41543530081).
It is a Harshad number since it is a multiple of its sum of digits (30).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 3477187 + ... + 3489113.
It is an arithmetic number, because the mean of its divisors is an integer number (1171425024).
Almost surely, 241543530050 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 41543530050, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (56228401152).
41543530050 is an abundant number, since it is smaller than the sum of its proper divisors (70913272254).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
41543530050 is a wasteful number, since it uses less digits than its factorization.
41543530050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14064 (or 14059 counting only the distinct ones).
The product of its (nonzero) digits is 18000, while the sum is 30.
The spelling of 41543530050 in words is "forty-one billion, five hundred forty-three million, five hundred thirty thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •