Base | Representation |
---|---|
bin | 10010001111111101110100… |
… | …01011111100111111100001 |
3 | 12021002111010121110011012220 |
4 | 21013332322023330333201 |
5 | 20230001243301021423 |
6 | 221203532304141253 |
7 | 11311240445266452 |
oct | 1107767213747741 |
9 | 167074117404186 |
10 | 40131003142113 |
11 | 11872510073774 |
12 | 46017a7907829 |
13 | 19514502396c0 |
14 | 9ca4cacad129 |
15 | 498d75b829e3 |
hex | 247fba2fcfe1 |
40131003142113 has 16 divisors (see below), whose sum is σ = 57629168115456. Its totient is φ = 24693788960640.
The previous prime is 40131003142093. The next prime is 40131003142121. The reversal of 40131003142113 is 31124130013104.
It is a happy number.
It is not a de Polignac number, because 40131003142113 - 224 = 40130986364897 is a prime.
It is a super-2 number, since 2×401310031421132 (a number of 28 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (40131003142613) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 45662745 + ... + 46533302.
It is an arithmetic number, because the mean of its divisors is an integer number (3601823007216).
Almost surely, 240131003142113 is an apocalyptic number.
It is an amenable number.
40131003142113 is a deficient number, since it is larger than the sum of its proper divisors (17498164973343).
40131003142113 is a wasteful number, since it uses less digits than its factorization.
40131003142113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 92207224.
The product of its (nonzero) digits is 864, while the sum is 24.
Adding to 40131003142113 its reverse (31124130013104), we get a palindrome (71255133155217).
The spelling of 40131003142113 in words is "forty trillion, one hundred thirty-one billion, three million, one hundred forty-two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •