Base | Representation |
---|---|
bin | 10010010101011110101011… |
… | …01100110110001111111111 |
3 | 12021202121010000112211211002 |
4 | 21022233111230312033333 |
5 | 20241102231441423403 |
6 | 221430542252320515 |
7 | 11331025113203234 |
oct | 1112572554661777 |
9 | 167677100484732 |
10 | 40320443311103 |
11 | 119358931085aa |
12 | 4632456a7313b |
13 | 1966280898257 |
14 | 9d573c73d78b |
15 | 49dc62013188 |
hex | 24abd5b363ff |
40320443311103 has 12 divisors (see below), whose sum is σ = 40579587798192. Its totient is φ = 40062346536960.
The previous prime is 40320443311097. The next prime is 40320443311117. The reversal of 40320443311103 is 30111334402304.
It is a happy number.
It is not a de Polignac number, because 40320443311103 - 236 = 40251723834367 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40320443316103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 40007798 + ... + 41003228.
It is an arithmetic number, because the mean of its divisors is an integer number (3381632316516).
Almost surely, 240320443311103 is an apocalyptic number.
40320443311103 is a deficient number, since it is larger than the sum of its proper divisors (259144487089).
40320443311103 is an frugal number, since it uses more digits than its factorization.
40320443311103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 996482 (or 996085 counting only the distinct ones).
The product of its (nonzero) digits is 10368, while the sum is 29.
Adding to 40320443311103 its reverse (30111334402304), we get a palindrome (70431777713407).
The spelling of 40320443311103 in words is "forty trillion, three hundred twenty billion, four hundred forty-three million, three hundred eleven thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •