Base | Representation |
---|---|
bin | 101000001010111111… |
… | …101100111010000011 |
3 | 11010100002111112222202 |
4 | 220022333230322003 |
5 | 1201314320103011 |
6 | 31452054223415 |
7 | 3054622114151 |
oct | 501277547203 |
9 | 133302445882 |
10 | 43134144131 |
11 | 17325110a01 |
12 | 8439654b6b |
13 | 40b54a3910 |
14 | 21329323d1 |
15 | 11c6c2723b |
hex | a0afece83 |
43134144131 has 8 divisors (see below), whose sum is σ = 46456182864. Its totient is φ = 39812680800.
The previous prime is 43134144121. The next prime is 43134144161. The reversal of 43134144131 is 13144143134.
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-43134144131 is a prime.
It is a super-2 number, since 2×431341441312 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 43134144094 and 43134144103.
It is not an unprimeable number, because it can be changed into a prime (43134144121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 18656 + ... + 294306.
It is an arithmetic number, because the mean of its divisors is an integer number (5807022858).
Almost surely, 243134144131 is an apocalyptic number.
43134144131 is a deficient number, since it is larger than the sum of its proper divisors (3322038733).
43134144131 is a wasteful number, since it uses less digits than its factorization.
43134144131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 287701.
The product of its digits is 6912, while the sum is 29.
Adding to 43134144131 its reverse (13144143134), we get a palindrome (56278287265).
The spelling of 43134144131 in words is "forty-three billion, one hundred thirty-four 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 •