Base | Representation |
---|---|
bin | 11000000101001101… |
… | …01000010100010011 |
3 | 1020101000102001122212 |
4 | 30002212220110103 |
5 | 202434204123211 |
6 | 5534520222335 |
7 | 635245066415 |
oct | 140246502423 |
9 | 36330361585 |
10 | 12928582931 |
11 | 5534936790 |
12 | 260990a9ab |
13 | 12b0658194 |
14 | 8a90989b5 |
15 | 50a04638b |
hex | 3029a8513 |
12928582931 has 16 divisors (see below), whose sum is σ = 14720535648. Its totient is φ = 11250220800.
The previous prime is 12928582913. The next prime is 12928582967. The reversal of 12928582931 is 13928582921.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 12928582931 - 26 = 12928582867 is a prime.
It is a super-2 number, since 2×129285829312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 12928582931.
It is not an unprimeable number, because it can be changed into a prime (12928582531) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 246536 + ... + 294341.
It is an arithmetic number, because the mean of its divisors is an integer number (920033478).
Almost surely, 212928582931 is an apocalyptic number.
12928582931 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
12928582931 is a deficient number, since it is larger than the sum of its proper divisors (1791952717).
12928582931 is a wasteful number, since it uses less digits than its factorization.
12928582931 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 540982.
The product of its digits is 622080, while the sum is 50.
The spelling of 12928582931 in words is "twelve billion, nine hundred twenty-eight million, five hundred eighty-two thousand, nine hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •