Base | Representation |
---|---|
bin | 100101101100011101… |
… | …010001110100000011 |
3 | 10212110201120111101202 |
4 | 211230131101310003 |
5 | 1130342411221011 |
6 | 30332121051415 |
7 | 2631664021220 |
oct | 455435216403 |
9 | 125421514352 |
10 | 40474320131 |
11 | 1618a775853 |
12 | 7a16926b6b |
13 | 3a80415b6b |
14 | 1d5d59a947 |
15 | 10bd47b23b |
hex | 96c751d03 |
40474320131 has 8 divisors (see below), whose sum is σ = 46361736960. Its totient is φ = 34613246088.
The previous prime is 40474320097. The next prime is 40474320149. The reversal of 40474320131 is 13102347404.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-40474320131 is a prime.
It is a super-2 number, since 2×404743201312 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 40474320094 and 40474320103.
It is not an unprimeable number, because it can be changed into a prime (40474320431) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6582401 + ... + 6588546.
It is an arithmetic number, because the mean of its divisors is an integer number (5795217120).
Almost surely, 240474320131 is an apocalyptic number.
40474320131 is a deficient number, since it is larger than the sum of its proper divisors (5887416829).
40474320131 is a wasteful number, since it uses less digits than its factorization.
40474320131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13171393.
The product of its (nonzero) digits is 8064, while the sum is 29.
Adding to 40474320131 its reverse (13102347404), we get a palindrome (53576667535).
The spelling of 40474320131 in words is "forty billion, four hundred seventy-four million, three hundred twenty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •