Base | Representation |
---|---|
bin | 11110010011100110… |
… | …100100111000000101 |
3 | 10002222211212220100211 |
4 | 132103212210320011 |
5 | 1013121012244331 |
6 | 22541005235421 |
7 | 2231254035532 |
oct | 362346447005 |
9 | 102884786324 |
10 | 32541134341 |
11 | 12889692961 |
12 | 6381b62b71 |
13 | 30b79974a1 |
14 | 1809b25d89 |
15 | ca6c7c8b1 |
hex | 7939a4e05 |
32541134341 has 16 divisors (see below), whose sum is σ = 35609656320. Its totient is φ = 29603255040.
The previous prime is 32541134333. The next prime is 32541134363. The reversal of 32541134341 is 14343114523.
It is a cyclic number.
It is not a de Polignac number, because 32541134341 - 23 = 32541134333 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (32541134441) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 405355 + ... + 478951.
It is an arithmetic number, because the mean of its divisors is an integer number (2225603520).
Almost surely, 232541134341 is an apocalyptic number.
32541134341 is a gapful number since it is divisible by the number (31) formed by its first and last digit.
It is an amenable number.
32541134341 is a deficient number, since it is larger than the sum of its proper divisors (3068521979).
32541134341 is a wasteful number, since it uses less digits than its factorization.
32541134341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 74484.
The product of its digits is 17280, while the sum is 31.
Adding to 32541134341 its reverse (14343114523), we get a palindrome (46884248864).
The spelling of 32541134341 in words is "thirty-two billion, five hundred forty-one million, one hundred thirty-four thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •