Base | Representation |
---|---|
bin | 10010010010111000001100… |
… | …10101001110001001000101 |
3 | 12021110001102002021111201202 |
4 | 21021130012111032021011 |
5 | 20233121210102403002 |
6 | 221321521314432245 |
7 | 11321412202142663 |
oct | 1111340625161105 |
9 | 167401362244652 |
10 | 40231064887877 |
11 | 11900998342326 |
12 | 4619072292685 |
13 | 195aa087878a6 |
14 | 9d12a0203c33 |
15 | 49b780517502 |
hex | 24970654e245 |
40231064887877 has 16 divisors (see below), whose sum is σ = 42415097065920. Its totient is φ = 38053698336000.
The previous prime is 40231064887843. The next prime is 40231064887903. The reversal of 40231064887877 is 77878846013204.
It is a cyclic number.
It is not a de Polignac number, because 40231064887877 - 212 = 40231064883781 is a prime.
It is a super-2 number, since 2×402310648878772 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40231064887807) 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 in 15 ways as a sum of consecutive naturals, for example, 392022302 + ... + 392124912.
It is an arithmetic number, because the mean of its divisors is an integer number (2650943566620).
Almost surely, 240231064887877 is an apocalyptic number.
It is an amenable number.
40231064887877 is a deficient number, since it is larger than the sum of its proper divisors (2184032178043).
40231064887877 is a wasteful number, since it uses less digits than its factorization.
40231064887877 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 134884.
The product of its (nonzero) digits is 101154816, while the sum is 65.
The spelling of 40231064887877 in words is "forty trillion, two hundred thirty-one billion, sixty-four million, eight hundred eighty-seven thousand, eight hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •