Base | Representation |
---|---|
bin | 10010001111111110010000… |
… | …00100110001100111100001 |
3 | 12021002111201211212202100012 |
4 | 21013333020010301213201 |
5 | 20230002232423012122 |
6 | 221204011350134305 |
7 | 11311246304614202 |
oct | 1107771004614741 |
9 | 167074654782305 |
10 | 40131236141537 |
11 | 1187261a645682 |
12 | 4601851951395 |
13 | 19514895a8c98 |
14 | 9ca50dc015a9 |
15 | 498d8b3597e2 |
hex | 247fc81319e1 |
40131236141537 has 2 divisors, whose sum is σ = 40131236141538. Its totient is φ = 40131236141536.
The previous prime is 40131236141531. The next prime is 40131236141603. The reversal of 40131236141537 is 73514163213104.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 31488247650721 + 8642988490816 = 5611439^2 + 2939896^2 .
It is a cyclic number.
It is not a de Polignac number, because 40131236141537 - 26 = 40131236141473 is a prime.
It is a super-2 number, since 2×401312361415372 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 40131236141494 and 40131236141503.
It is not a weakly prime, because it can be changed into another prime (40131236141531) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20065618070768 + 20065618070769.
It is an arithmetic number, because the mean of its divisors is an integer number (20065618070769).
Almost surely, 240131236141537 is an apocalyptic number.
It is an amenable number.
40131236141537 is a deficient number, since it is larger than the sum of its proper divisors (1).
40131236141537 is an equidigital number, since it uses as much as digits as its factorization.
40131236141537 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 181440, while the sum is 41.
The spelling of 40131236141537 in words is "forty trillion, one hundred thirty-one billion, two hundred thirty-six million, one hundred forty-one thousand, five hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •