Base | Representation |
---|---|
bin | 10010101010100101001111… |
… | …01000111011000110101111 |
3 | 12101022220122212021012120012 |
4 | 21111102213220323012233 |
5 | 20334442211110103003 |
6 | 223144015050243435 |
7 | 11434304151330161 |
oct | 1125224750730657 |
9 | 171286585235505 |
10 | 41045520003503 |
11 | 12095341a95374 |
12 | 472aa9172657b |
13 | 19b9764411402 |
14 | a1c884272931 |
15 | 4b2a4c88b8d8 |
hex | 2554a7a3b1af |
41045520003503 has 8 divisors (see below), whose sum is σ = 41854784794416. Its totient is φ = 40237544880000.
The previous prime is 41045520003491. The next prime is 41045520003517. The reversal of 41045520003503 is 30530002554014.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 41045520003503 - 228 = 41045251568047 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 41045520003503.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (41045520003583) 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, 322352573 + ... + 322479878.
It is an arithmetic number, because the mean of its divisors is an integer number (5231848099302).
Almost surely, 241045520003503 is an apocalyptic number.
41045520003503 is a deficient number, since it is larger than the sum of its proper divisors (809264790913).
41045520003503 is a wasteful number, since it uses less digits than its factorization.
41045520003503 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 644833705.
The product of its (nonzero) digits is 36000, while the sum is 32.
Adding to 41045520003503 its reverse (30530002554014), we get a palindrome (71575522557517).
The spelling of 41045520003503 in words is "forty-one trillion, forty-five billion, five hundred twenty million, three thousand, five hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •