Base | Representation |
---|---|
bin | 1111010010110011… |
… | …1110110001001101 |
3 | 101121010002120011021 |
4 | 3310230332301031 |
5 | 31401442312031 |
6 | 1515213354141 |
7 | 203510411626 |
oct | 36454766115 |
9 | 11533076137 |
10 | 4105432141 |
11 | 1817455a28 |
12 | 966a98951 |
13 | 5057178b5 |
14 | 2ad35aa4d |
15 | 19064e511 |
hex | f4b3ec4d |
4105432141 has 2 divisors, whose sum is σ = 4105432142. Its totient is φ = 4105432140.
The previous prime is 4105432103. The next prime is 4105432189. The reversal of 4105432141 is 1412345014.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4041272041 + 64160100 = 63571^2 + 8010^2 .
It is a cyclic number.
It is not a de Polignac number, because 4105432141 - 227 = 3971214413 is a prime.
It is an alternating number because its digits alternate between even and odd.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4105430141) 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 as a sum of consecutive naturals, namely, 2052716070 + 2052716071.
It is an arithmetic number, because the mean of its divisors is an integer number (2052716071).
Almost surely, 24105432141 is an apocalyptic number.
It is an amenable number.
4105432141 is a deficient number, since it is larger than the sum of its proper divisors (1).
4105432141 is an equidigital number, since it uses as much as digits as its factorization.
4105432141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1920, while the sum is 25.
The square root of 4105432141 is about 64073.6462283832. The cubic root of 4105432141 is about 1601.2272018535.
Adding to 4105432141 its reverse (1412345014), we get a palindrome (5517777155).
The spelling of 4105432141 in words is "four billion, one hundred five million, four hundred thirty-two thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •