Base | Representation |
---|---|
bin | 10010100001000000001101… |
… | …11011000111001000110111 |
3 | 12100011110011100102220202210 |
4 | 21100200012323013020313 |
5 | 20314044144432000421 |
6 | 222332505253504503 |
7 | 11401443333452553 |
oct | 1120400673071067 |
9 | 170143140386683 |
10 | 40716406125111 |
11 | 11a78804868352 |
12 | 4697142042133 |
13 | 1994704995132 |
14 | a0a98266c863 |
15 | 4a91d928d576 |
hex | 250806ec7237 |
40716406125111 has 4 divisors (see below), whose sum is σ = 54288541500152. Its totient is φ = 27144270750072.
The previous prime is 40716406125091. The next prime is 40716406125137. The reversal of 40716406125111 is 11152160461704.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 40716406125111 - 217 = 40716405994039 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 40716406125111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40716406125511) 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, 6786067687516 + ... + 6786067687521.
It is an arithmetic number, because the mean of its divisors is an integer number (13572135375038).
Almost surely, 240716406125111 is an apocalyptic number.
40716406125111 is a deficient number, since it is larger than the sum of its proper divisors (13572135375041).
40716406125111 is a wasteful number, since it uses less digits than its factorization.
40716406125111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13572135375040.
The product of its (nonzero) digits is 40320, while the sum is 39.
Adding to 40716406125111 its reverse (11152160461704), we get a palindrome (51868566586815).
The spelling of 40716406125111 in words is "forty trillion, seven hundred sixteen billion, four hundred six million, one hundred twenty-five thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •