Base | Representation |
---|---|
bin | 10010010000010010111010… |
… | …01010111110000011000001 |
3 | 12021010120100211020101210212 |
4 | 21020021131022332003001 |
5 | 20230142441320130324 |
6 | 221213044120403505 |
7 | 11312121203632115 |
oct | 1110113512760301 |
9 | 167116324211725 |
10 | 40142327505089 |
11 | 118772a1406237 |
12 | 4603a28316595 |
13 | 19525364120b4 |
14 | 9cac82c95745 |
15 | 4992d9e4470e |
hex | 24825d2be0c1 |
40142327505089 has 2 divisors, whose sum is σ = 40142327505090. Its totient is φ = 40142327505088.
The previous prime is 40142327505043. The next prime is 40142327505107. The reversal of 40142327505089 is 98050572324104.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 33459109828225 + 6683217676864 = 5784385^2 + 2585192^2 .
It is a cyclic number.
It is not a de Polignac number, because 40142327505089 - 216 = 40142327439553 is a prime.
It is a super-2 number, since 2×401423275050892 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (40142327505029) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20071163752544 + 20071163752545.
It is an arithmetic number, because the mean of its divisors is an integer number (20071163752545).
Almost surely, 240142327505089 is an apocalyptic number.
It is an amenable number.
40142327505089 is a deficient number, since it is larger than the sum of its proper divisors (1).
40142327505089 is an equidigital number, since it uses as much as digits as its factorization.
40142327505089 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2419200, while the sum is 50.
The spelling of 40142327505089 in words is "forty trillion, one hundred forty-two billion, three hundred twenty-seven million, five hundred five thousand, eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.123 sec. • engine limits •