Base | Representation |
---|---|
bin | 10010010000000100000001… |
… | …01110101101110100010011 |
3 | 12021002210201202022120110101 |
4 | 21020002000232231310103 |
5 | 20230030104020100023 |
6 | 221205243015113231 |
7 | 11311416133321516 |
oct | 1110020056556423 |
9 | 167083652276411 |
10 | 40134334143763 |
11 | 1187396a3625a2 |
12 | 4602377372817 |
13 | 19518613848b2 |
14 | 9ca725438d7d |
15 | 498ebd30b1ad |
hex | 248080badd13 |
40134334143763 has 2 divisors, whose sum is σ = 40134334143764. Its totient is φ = 40134334143762.
The previous prime is 40134334143733. The next prime is 40134334143809. The reversal of 40134334143763 is 36734143343104.
It is an a-pointer prime, because the next prime (40134334143809) can be obtained adding 40134334143763 to its sum of digits (46).
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-40134334143763 is a prime.
It is a super-2 number, since 2×401343341437632 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (40134334143733) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20067167071881 + 20067167071882.
It is an arithmetic number, because the mean of its divisors is an integer number (20067167071882).
Almost surely, 240134334143763 is an apocalyptic number.
40134334143763 is a deficient number, since it is larger than the sum of its proper divisors (1).
40134334143763 is an equidigital number, since it uses as much as digits as its factorization.
40134334143763 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2612736, while the sum is 46.
Adding to 40134334143763 its reverse (36734143343104), we get a palindrome (76868477486867).
The spelling of 40134334143763 in words is "forty trillion, one hundred thirty-four billion, three hundred thirty-four million, one hundred forty-three thousand, seven hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •