Base | Representation |
---|---|
bin | 11110001011111110… |
… | …010000011000101110 |
3 | 10002122221000022101100 |
4 | 132023332100120232 |
5 | 1012340224433032 |
6 | 22520153423530 |
7 | 2225141003130 |
oct | 361376203056 |
9 | 102587008340 |
10 | 32413124142 |
11 | 128233aaa03 |
12 | 634710aba6 |
13 | 30972c75c9 |
14 | 17d6b23050 |
15 | c9a8e397c |
hex | 78bf9062e |
32413124142 has 24 divisors (see below), whose sum is σ = 80261069616. Its totient is φ = 9260892576.
The previous prime is 32413124129. The next prime is 32413124147. The reversal of 32413124142 is 24142131423.
32413124142 is a `hidden beast` number, since 3 + 2 + 413 + 1 + 241 + 4 + 2 = 666.
It is a super-2 number, since 2×324131241422 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (32413124147) 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 in 11 ways as a sum of consecutive naturals, for example, 128623383 + ... + 128623634.
It is an arithmetic number, because the mean of its divisors is an integer number (3344211234).
Almost surely, 232413124142 is an apocalyptic number.
32413124142 is an abundant number, since it is smaller than the sum of its proper divisors (47847945474).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
32413124142 is a wasteful number, since it uses less digits than its factorization.
32413124142 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 257247032 (or 257247029 counting only the distinct ones).
The product of its digits is 4608, while the sum is 27.
Adding to 32413124142 its reverse (24142131423), we get a palindrome (56555255565).
The spelling of 32413124142 in words is "thirty-two billion, four hundred thirteen million, one hundred twenty-four thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •