Base | Representation |
---|---|
bin | 11101110101110011… |
… | …010000011101111101 |
3 | 10001201000001200000012 |
4 | 131311303100131331 |
5 | 1011110013022031 |
6 | 22415224513005 |
7 | 2213003133401 |
oct | 356563203575 |
9 | 101630050005 |
10 | 32041142141 |
11 | 12652431368 |
12 | 626261b765 |
13 | 3038215b08 |
14 | 179d573101 |
15 | c77e16b2b |
hex | 775cd077d |
32041142141 has 4 divisors (see below), whose sum is σ = 32371463292. Its totient is φ = 31710820992.
The previous prime is 32041142129. The next prime is 32041142143. The reversal of 32041142141 is 14124114023.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 14124114023 = 1129 ⋅12510287.
It can be written as a sum of positive squares in 2 ways, for example, as 10287842041 + 21753300100 = 101429^2 + 147490^2 .
It is a cyclic number.
It is not a de Polignac number, because 32041142141 - 210 = 32041141117 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 (32041142143) 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, 165160430 + ... + 165160623.
It is an arithmetic number, because the mean of its divisors is an integer number (8092865823).
Almost surely, 232041142141 is an apocalyptic number.
It is an amenable number.
32041142141 is a deficient number, since it is larger than the sum of its proper divisors (330321151).
32041142141 is an equidigital number, since it uses as much as digits as its factorization.
32041142141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 330321150.
The product of its (nonzero) digits is 768, while the sum is 23.
Adding to 32041142141 its reverse (14124114023), we get a palindrome (46165256164).
The spelling of 32041142141 in words is "thirty-two billion, forty-one million, one hundred forty-two thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •