Base | Representation |
---|---|
bin | 10111100011000000… |
… | …11111010100010011 |
3 | 1012122000200222022000 |
4 | 23301200133110103 |
5 | 201342242314111 |
6 | 5450232445043 |
7 | 625163122461 |
oct | 136140372423 |
9 | 35560628260 |
10 | 12641760531 |
11 | 53a7a42884 |
12 | 2549849783 |
13 | 12660c239a |
14 | 87cd55831 |
15 | 4dec8bc56 |
hex | 2f181f513 |
12641760531 has 32 divisors (see below), whose sum is σ = 19176587520. Its totient is φ = 8228449152.
The previous prime is 12641760529. The next prime is 12641760557. The reversal of 12641760531 is 13506714621.
12641760531 is a `hidden beast` number, since 1 + 2 + 6 + 4 + 17 + 605 + 31 = 666.
12641760531 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 12641760531 - 21 = 12641760529 is a prime.
It is a super-2 number, since 2×126417605312 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (12641760581) 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 31 ways as a sum of consecutive naturals, for example, 173496 + ... + 235338.
It is an arithmetic number, because the mean of its divisors is an integer number (599268360).
Almost surely, 212641760531 is an apocalyptic number.
12641760531 is a deficient number, since it is larger than the sum of its proper divisors (6534826989).
12641760531 is a wasteful number, since it uses less digits than its factorization.
12641760531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 62032 (or 62026 counting only the distinct ones).
The product of its (nonzero) digits is 30240, while the sum is 36.
The spelling of 12641760531 in words is "twelve billion, six hundred forty-one million, seven hundred sixty thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •