Base | Representation |
---|---|
bin | 11110000111110110… |
… | …111101010011111101 |
3 | 10002111010010121222221 |
4 | 132013312331103331 |
5 | 1012220042232031 |
6 | 22505250205341 |
7 | 2223342221611 |
oct | 360766752375 |
9 | 102433117887 |
10 | 32344102141 |
11 | 1279844772a |
12 | 6327b83851 |
13 | 3085c0bca0 |
14 | 17cb8b7341 |
15 | c9480ca11 |
hex | 787dbd4fd |
32344102141 has 8 divisors (see below), whose sum is σ = 34844584824. Its totient is φ = 29845401600.
The previous prime is 32344102129. The next prime is 32344102207. The reversal of 32344102141 is 14120144323.
It can be written as a sum of positive squares in 4 ways, for example, as 41229241 + 32302872900 = 6421^2 + 179730^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 32344102141 - 219 = 32343577853 is a prime.
It is a super-2 number, since 2×323441021412 (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 (32344102121) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 407716 + ... + 480541.
It is an arithmetic number, because the mean of its divisors is an integer number (4355573103).
Almost surely, 232344102141 is an apocalyptic number.
It is an amenable number.
32344102141 is a deficient number, since it is larger than the sum of its proper divisors (2500482683).
32344102141 is a wasteful number, since it uses less digits than its factorization.
32344102141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 891071.
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 32344102141 its reverse (14120144323), we get a palindrome (46464246464).
The spelling of 32344102141 in words is "thirty-two billion, three hundred forty-four million, one hundred two thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •