Base | Representation |
---|---|
bin | 10010010000100111111111… |
… | …01000100100111110011111 |
3 | 12021011122120102112201000021 |
4 | 21020103333220210332133 |
5 | 20230334130114012203 |
6 | 221222155021213011 |
7 | 11313001464660562 |
oct | 1110237750447637 |
9 | 167148512481007 |
10 | 40153643110303 |
11 | 11881078806988 |
12 | 4606065a01167 |
13 | 195361a83c498 |
14 | 9cb637a3c4d9 |
15 | 49974d5765bd |
hex | 2484ffa24f9f |
40153643110303 has 4 divisors (see below), whose sum is σ = 40153914572200. Its totient is φ = 40153371648408.
The previous prime is 40153643110249. The next prime is 40153643110307. The reversal of 40153643110303 is 30301134635104.
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 40153643110303 - 29 = 40153643109791 is a prime.
It is a super-2 number, since 2×401536431103032 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40153643110307) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 135508953 + ... + 135804946.
It is an arithmetic number, because the mean of its divisors is an integer number (10038478643050).
Almost surely, 240153643110303 is an apocalyptic number.
40153643110303 is a deficient number, since it is larger than the sum of its proper divisors (271461897).
40153643110303 is a wasteful number, since it uses less digits than its factorization.
40153643110303 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 271461896.
The product of its (nonzero) digits is 38880, while the sum is 34.
Adding to 40153643110303 its reverse (30301134635104), we get a palindrome (70454777745407).
The spelling of 40153643110303 in words is "forty trillion, one hundred fifty-three billion, six hundred forty-three million, one hundred ten thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •