Base | Representation |
---|---|
bin | 11000000101100100… |
… | …00011100000000000 |
3 | 1020101020001012221000 |
4 | 30002302003200000 |
5 | 202440440442411 |
6 | 5535104332000 |
7 | 635312412111 |
oct | 140262034000 |
9 | 36336035830 |
10 | 12931577856 |
11 | 55365a192a |
12 | 260a914000 |
13 | 12b1166422 |
14 | 8a9638208 |
15 | 50a438956 |
hex | 302c83800 |
12931577856 has 96 divisors (see below), whose sum is σ = 38306595600. Its totient is φ = 4310507520.
The previous prime is 12931577851. The next prime is 12931577873. The reversal of 12931577856 is 65877513921.
12931577856 is a `hidden beast` number, since 12 + 9 + 3 + 1 + 577 + 8 + 56 = 666.
It is a tau number, because it is divible by the number of its divisors (96).
It is a Smith number, since the sum of its digits (54) coincides with the sum of the digits of its prime factors.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12931577851) 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, 61635 + ... + 172226.
Almost surely, 212931577856 is an apocalyptic number.
12931577856 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
12931577856 is an abundant number, since it is smaller than the sum of its proper divisors (25375017744).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12931577856 is an equidigital number, since it uses as much as digits as its factorization.
12931577856 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 233892 (or 233866 counting only the distinct ones).
The product of its digits is 3175200, while the sum is 54.
The spelling of 12931577856 in words is "twelve billion, nine hundred thirty-one million, five hundred seventy-seven thousand, eight hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •