Base | Representation |
---|---|
bin | 101000010101000011… |
… | …110101100001001101 |
3 | 11010202212020022220001 |
4 | 220111003311201031 |
5 | 1202141032001031 |
6 | 31520525324301 |
7 | 3062042266552 |
oct | 502503654115 |
9 | 133685208801 |
10 | 43303000141 |
11 | 17401461a25 |
12 | 8486106691 |
13 | 411147530b |
14 | 214b128a29 |
15 | 11d697d861 |
hex | a150f584d |
43303000141 has 4 divisors (see below), whose sum is σ = 43619080572. Its totient is φ = 42986919712.
The previous prime is 43303000133. The next prime is 43303000157. The reversal of 43303000141 is 14100030334.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 37860987241 + 5442012900 = 194579^2 + 73770^2 .
It is a cyclic number.
It is not a de Polignac number, because 43303000141 - 23 = 43303000133 is a prime.
It is a super-2 number, since 2×433030001412 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (43303000121) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 158040010 + ... + 158040283.
It is an arithmetic number, because the mean of its divisors is an integer number (10904770143).
Almost surely, 243303000141 is an apocalyptic number.
It is an amenable number.
43303000141 is a deficient number, since it is larger than the sum of its proper divisors (316080431).
43303000141 is a wasteful number, since it uses less digits than its factorization.
43303000141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 316080430.
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 43303000141 its reverse (14100030334), we get a palindrome (57403030475).
The spelling of 43303000141 in words is "forty-three billion, three hundred three million, one hundred forty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •