Base | Representation |
---|---|
bin | 100101110100110111… |
… | …000111001100110011 |
3 | 10212211112212112022121 |
4 | 211310313013030303 |
5 | 1131140004411011 |
6 | 30354115015111 |
7 | 2635325303614 |
oct | 456467071463 |
9 | 125745775277 |
10 | 40615310131 |
11 | 16252313710 |
12 | 7a55b9a497 |
13 | 3aa36ab9b6 |
14 | 1d741bbc0b |
15 | 10caa2ae71 |
hex | 974dc7333 |
40615310131 has 16 divisors (see below), whose sum is σ = 44523198720. Its totient is φ = 36743655520.
The previous prime is 40615310129. The next prime is 40615310137. The reversal of 40615310131 is 13101351604.
It is not a de Polignac number, because 40615310131 - 21 = 40615310129 is a prime.
It is a super-2 number, since 2×406153101312 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 40615310096 and 40615310105.
It is not an unprimeable number, because it can be changed into a prime (40615310137) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2923680 + ... + 2937538.
It is an arithmetic number, because the mean of its divisors is an integer number (2782699920).
Almost surely, 240615310131 is an apocalyptic number.
40615310131 is a deficient number, since it is larger than the sum of its proper divisors (3907888589).
40615310131 is a wasteful number, since it uses less digits than its factorization.
40615310131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15146.
The product of its (nonzero) digits is 1080, while the sum is 25.
Adding to 40615310131 its reverse (13101351604), we get a palindrome (53716661735).
The spelling of 40615310131 in words is "forty billion, six hundred fifteen million, three hundred ten thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •