Base | Representation |
---|---|
bin | 10010010000010001011010… |
… | …01011110101011101110001 |
3 | 12021010111021201100010112012 |
4 | 21020020231023311131301 |
5 | 20230134314220110323 |
6 | 221212432201012305 |
7 | 11312062226601662 |
oct | 1110105513653561 |
9 | 167114251303465 |
10 | 40141522425713 |
11 | 11876a18a16185 |
12 | 4603842784095 |
13 | 19524386a1277 |
14 | 9cac07da7369 |
15 | 49928e417678 |
hex | 24822d2f5771 |
40141522425713 has 2 divisors, whose sum is σ = 40141522425714. Its totient is φ = 40141522425712.
The previous prime is 40141522425691. The next prime is 40141522425737. The reversal of 40141522425713 is 31752422514104.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 39703394929969 + 438127495744 = 6301063^2 + 661912^2 .
It is a cyclic number.
It is not a de Polignac number, because 40141522425713 - 242 = 35743475914609 is a prime.
It is a super-2 number, since 2×401415224257132 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (40141522425013) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20070761212856 + 20070761212857.
It is an arithmetic number, because the mean of its divisors is an integer number (20070761212857).
Almost surely, 240141522425713 is an apocalyptic number.
It is an amenable number.
40141522425713 is a deficient number, since it is larger than the sum of its proper divisors (1).
40141522425713 is an equidigital number, since it uses as much as digits as its factorization.
40141522425713 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 268800, while the sum is 41.
Adding to 40141522425713 its reverse (31752422514104), we get a palindrome (71893944939817).
The spelling of 40141522425713 in words is "forty trillion, one hundred forty-one billion, five hundred twenty-two million, four hundred twenty-five thousand, seven hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •