Base | Representation |
---|---|
bin | 10010011000011001000111… |
… | …11111111111101011010111 |
3 | 12022010011111000101111220122 |
4 | 21030030203333333223113 |
5 | 20244222232021413421 |
6 | 221544535033422155 |
7 | 11341200456215321 |
oct | 1114144377775327 |
9 | 168104430344818 |
10 | 40420541201111 |
11 | 11974289823935 |
12 | 464993156a95b |
13 | 197284375cc76 |
14 | 9da5167a2611 |
15 | 4a166eb372ab |
hex | 24c323fffad7 |
40420541201111 has 8 divisors (see below), whose sum is σ = 42798345696144. Its totient is φ = 38042750661760.
The previous prime is 40420541201081. The next prime is 40420541201119. The reversal of 40420541201111 is 11110214502404.
It is a happy number.
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 40420541201111 - 238 = 40145663294167 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40420541201119) 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 7 ways as a sum of consecutive naturals, for example, 2797841 + ... + 9416421.
It is an arithmetic number, because the mean of its divisors is an integer number (5349793212018).
Almost surely, 240420541201111 is an apocalyptic number.
40420541201111 is a deficient number, since it is larger than the sum of its proper divisors (2377804495033).
40420541201111 is a wasteful number, since it uses less digits than its factorization.
40420541201111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6977841.
The product of its (nonzero) digits is 1280, while the sum is 26.
Adding to 40420541201111 its reverse (11110214502404), we get a palindrome (51530755703515).
The spelling of 40420541201111 in words is "forty trillion, four hundred twenty billion, five hundred forty-one million, two hundred one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •