Base | Representation |
---|---|
bin | 100101110001001010… |
… | …110001010010111111 |
3 | 10212200020021212002001 |
4 | 211301022301102333 |
5 | 1131023124320211 |
6 | 30344023043131 |
7 | 2633643553012 |
oct | 456112612277 |
9 | 125606255061 |
10 | 40553354431 |
11 | 16220347457 |
12 | 7a392a04a7 |
13 | 3a938c8815 |
14 | 1d69c91379 |
15 | 10c538dac1 |
hex | 9712b14bf |
40553354431 has 4 divisors (see below), whose sum is σ = 40555212264. Its totient is φ = 40551496600.
The previous prime is 40553354417. The next prime is 40553354437. The reversal of 40553354431 is 13445335504.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 40553354431 - 211 = 40553352383 is a prime.
It is a super-3 number, since 3×405533544313 (a number of 33 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40553354437) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 895780 + ... + 939961.
It is an arithmetic number, because the mean of its divisors is an integer number (10138803066).
Almost surely, 240553354431 is an apocalyptic number.
40553354431 is a deficient number, since it is larger than the sum of its proper divisors (1857833).
40553354431 is a wasteful number, since it uses less digits than its factorization.
40553354431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1857832.
The product of its (nonzero) digits is 216000, while the sum is 37.
Adding to 40553354431 its reverse (13445335504), we get a palindrome (53998689935).
The spelling of 40553354431 in words is "forty billion, five hundred fifty-three million, three hundred fifty-four thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •