Base | Representation |
---|---|
bin | 10010011011100111011111… |
… | …00011101000011101011101 |
3 | 12022111202110010000001102101 |
4 | 21031303233203220131131 |
5 | 20303031131102003240 |
6 | 222111500340525101 |
7 | 11352202103554111 |
oct | 1115635743503535 |
9 | 168452403001371 |
10 | 40531330500445 |
11 | 11a07271466244 |
12 | 46672b06b0791 |
13 | 198011b6342a5 |
14 | a01a26727741 |
15 | 4a44a619139a |
hex | 24dcef8e875d |
40531330500445 has 8 divisors (see below), whose sum is σ = 48641050323936. Its totient is φ = 32422761918096.
The previous prime is 40531330500421. The next prime is 40531330500469. The reversal of 40531330500445 is 54400503313504.
It is an interprime number because it is at equal distance from previous prime (40531330500421) and next prime (40531330500469).
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 40531330500445 - 219 = 40531329976157 is a prime.
It is a Duffinian number.
It is a congruent number.
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, 287732827 + ... + 287873656.
It is an arithmetic number, because the mean of its divisors is an integer number (6080131290492).
Almost surely, 240531330500445 is an apocalyptic number.
It is an amenable number.
40531330500445 is a deficient number, since it is larger than the sum of its proper divisors (8109719823491).
40531330500445 is a wasteful number, since it uses less digits than its factorization.
40531330500445 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 575620571.
The product of its (nonzero) digits is 216000, while the sum is 37.
Adding to 40531330500445 its reverse (54400503313504), we get a palindrome (94931833813949).
The spelling of 40531330500445 in words is "forty trillion, five hundred thirty-one billion, three hundred thirty million, five hundred thousand, four hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •