Base | Representation |
---|---|
bin | 10011101010011110101100… |
… | …10110111101100000001101 |
3 | 12200002210122212122020110002 |
4 | 21311033112112331200031 |
5 | 21131430113210042031 |
6 | 231544353402254045 |
7 | 12052030041332663 |
oct | 1165172626754015 |
9 | 180083585566402 |
10 | 43241032112141 |
11 | 12861467377126 |
12 | 4a2449a1b7325 |
13 | 1b187c526a716 |
14 | a96c3cb6ac33 |
15 | 4eebe9ce2ccb |
hex | 2753d65bd80d |
43241032112141 has 16 divisors (see below), whose sum is σ = 43648943137200. Its totient is φ = 42834730498560.
The previous prime is 43241032112137. The next prime is 43241032112219. The reversal of 43241032112141 is 14121123014234.
It can be written as a sum of positive squares in 8 ways, for example, as 9190422728041 + 34050609384100 = 3031571^2 + 5835290^2 .
It is a cyclic number.
It is not a de Polignac number, because 43241032112141 - 22 = 43241032112137 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (43241032112441) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 334563911 + ... + 334693131.
It is an arithmetic number, because the mean of its divisors is an integer number (2728058946075).
Almost surely, 243241032112141 is an apocalyptic number.
It is an amenable number.
43241032112141 is a deficient number, since it is larger than the sum of its proper divisors (407911025059).
43241032112141 is a wasteful number, since it uses less digits than its factorization.
43241032112141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 135424.
The product of its (nonzero) digits is 4608, while the sum is 29.
Adding to 43241032112141 its reverse (14121123014234), we get a palindrome (57362155126375).
The spelling of 43241032112141 in words is "forty-three trillion, two hundred forty-one billion, thirty-two million, one hundred twelve thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •