Base | Representation |
---|---|
bin | 10010100011110000101001… |
… | …11110011111110010111001 |
3 | 12100111111122220022222112112 |
4 | 21101320110332133302321 |
5 | 20322122144040032243 |
6 | 222444212544222105 |
7 | 11411335606212221 |
oct | 1121702476376271 |
9 | 170444586288475 |
10 | 40811131174073 |
11 | 120049a3670687 |
12 | 46b157930a935 |
13 | 19a061c6a8770 |
14 | a113aacd9081 |
15 | 4ab8d035e818 |
hex | 251e14f9fcb9 |
40811131174073 has 8 divisors (see below), whose sum is σ = 43950662383488. Its totient is φ = 37671630454224.
The previous prime is 40811131174057. The next prime is 40811131174181. The reversal of 40811131174073 is 37047113111804.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 40811131174073 - 24 = 40811131174057 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 40811131174073.
It is not an unprimeable number, because it can be changed into a prime (40811131176073) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4803761 + ... + 10232222.
It is an arithmetic number, because the mean of its divisors is an integer number (5493832797936).
Almost surely, 240811131174073 is an apocalyptic number.
It is an amenable number.
40811131174073 is a deficient number, since it is larger than the sum of its proper divisors (3139531209415).
40811131174073 is a wasteful number, since it uses less digits than its factorization.
40811131174073 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15244783.
The product of its (nonzero) digits is 56448, while the sum is 41.
Adding to 40811131174073 its reverse (37047113111804), we get a palindrome (77858244285877).
The spelling of 40811131174073 in words is "forty trillion, eight hundred eleven billion, one hundred thirty-one million, one hundred seventy-four thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •