Base | Representation |
---|---|
bin | 101000001010110011… |
… | …111000000100100101 |
3 | 11010022212200001121000 |
4 | 220022303320010211 |
5 | 1201313021403013 |
6 | 31451503543513 |
7 | 3054553553232 |
oct | 501263700445 |
9 | 133285601530 |
10 | 43131044133 |
11 | 17323393921 |
12 | 84385bab99 |
13 | 40b49598b8 |
14 | 2132366789 |
15 | 11c6813973 |
hex | a0acf8125 |
43131044133 has 32 divisors (see below), whose sum is σ = 64957697280. Its totient is φ = 28279342080.
The previous prime is 43131044129. The next prime is 43131044137. The reversal of 43131044133 is 33144013134.
It is an interprime number because it is at equal distance from previous prime (43131044129) and next prime (43131044137).
It is not a de Polignac number, because 43131044133 - 22 = 43131044129 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 43131044097 and 43131044106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (43131044137) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 664768 + ... + 726758.
It is an arithmetic number, because the mean of its divisors is an integer number (2029928040).
Almost surely, 243131044133 is an apocalyptic number.
It is an amenable number.
43131044133 is a deficient number, since it is larger than the sum of its proper divisors (21826653147).
43131044133 is a wasteful number, since it uses less digits than its factorization.
43131044133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 62426 (or 62420 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 27.
Adding to 43131044133 its reverse (33144013134), we get a palindrome (76275057267).
The spelling of 43131044133 in words is "forty-three billion, one hundred thirty-one million, forty-four thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •