Base | Representation |
---|---|
bin | 100101101010000000… |
… | …001101000101000011 |
3 | 10212100212002112112201 |
4 | 211222000031011003 |
5 | 1130301341103011 |
6 | 30324050334031 |
7 | 2630654024452 |
oct | 455200150503 |
9 | 125325075481 |
10 | 40433144131 |
11 | 161695016a6 |
12 | 7a04b8a317 |
13 | 3a74a29c73 |
14 | 1d57d1cb99 |
15 | 10b9a45cc1 |
hex | 96a00d143 |
40433144131 has 16 divisors (see below), whose sum is σ = 43214260320. Its totient is φ = 37697978880.
The previous prime is 40433144107. The next prime is 40433144177. The reversal of 40433144131 is 13144133404.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 40433144131 - 217 = 40433013059 is a prime.
It is a super-2 number, since 2×404331441312 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 40433144131.
It is not an unprimeable number, because it can be changed into a prime (40433144231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1070785 + ... + 1107901.
It is an arithmetic number, because the mean of its divisors is an integer number (2700891270).
Almost surely, 240433144131 is an apocalyptic number.
40433144131 is a deficient number, since it is larger than the sum of its proper divisors (2781116189).
40433144131 is a wasteful number, since it uses less digits than its factorization.
40433144131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37734.
The product of its (nonzero) digits is 6912, while the sum is 28.
Adding to 40433144131 its reverse (13144133404), we get a palindrome (53577277535).
The spelling of 40433144131 in words is "forty billion, four hundred thirty-three million, one hundred forty-four thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •