Base | Representation |
---|---|
bin | 10010010000010001000101… |
… | …00000110100001111001101 |
3 | 12021010110211020102110221200 |
4 | 21020020202200310033031 |
5 | 20230133432401020313 |
6 | 221212402323220113 |
7 | 11312054623653063 |
oct | 1110104240641715 |
9 | 167113736373850 |
10 | 40141343376333 |
11 | 11876936942791 |
12 | 46037b2817639 |
13 | 195240a570ca4 |
14 | 9cabcc2ba033 |
15 | 49927d84ab73 |
hex | 2482228343cd |
40141343376333 has 36 divisors (see below), whose sum is σ = 60620404895232. Its totient is φ = 25594040506320.
The previous prime is 40141343376313. The next prime is 40141343376367. The reversal of 40141343376333 is 33367334314104.
40141343376333 is a `hidden beast` number, since 4 + 0 + 1 + 4 + 1 + 3 + 4 + 3 + 3 + 7 + 633 + 3 = 666.
It is not a de Polignac number, because 40141343376333 - 221 = 40141341279181 is a prime.
It is a super-2 number, since 2×401413433763332 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40141343376313) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 36223348 + ... + 37315058.
Almost surely, 240141343376333 is an apocalyptic number.
It is an amenable number.
40141343376333 is a deficient number, since it is larger than the sum of its proper divisors (20479061518899).
40141343376333 is a wasteful number, since it uses less digits than its factorization.
40141343376333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1099486 (or 1099460 counting only the distinct ones).
The product of its (nonzero) digits is 1959552, while the sum is 45.
The spelling of 40141343376333 in words is "forty trillion, one hundred forty-one billion, three hundred forty-three million, three hundred seventy-six thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •