Base | Representation |
---|---|
bin | 10111111001010011… |
… | …01010101000010001 |
3 | 1020010001111021100111 |
4 | 23330221222220101 |
5 | 202233122344122 |
6 | 5520551521321 |
7 | 632623166011 |
oct | 137451525021 |
9 | 36101437314 |
10 | 12828715537 |
11 | 5493525950 |
12 | 25a0389241 |
13 | 1295a5cb51 |
14 | 899addc41 |
15 | 5013bad77 |
hex | 2fca6aa11 |
12828715537 has 8 divisors (see below), whose sum is σ = 14019564960. Its totient is φ = 11641966560.
The previous prime is 12828715511. The next prime is 12828715547. The reversal of 12828715537 is 73551782821.
12828715537 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 12828715537 - 219 = 12828191249 is a prime.
It is a super-3 number, since 3×128287155373 (a number of 31 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12828715547) 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 7 ways as a sum of consecutive naturals, for example, 1018563 + ... + 1031080.
It is an arithmetic number, because the mean of its divisors is an integer number (1752445620).
Almost surely, 212828715537 is an apocalyptic number.
It is an amenable number.
12828715537 is a deficient number, since it is larger than the sum of its proper divisors (1190849423).
12828715537 is a wasteful number, since it uses less digits than its factorization.
12828715537 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2050223.
The product of its digits is 940800, while the sum is 49.
The spelling of 12828715537 in words is "twelve billion, eight hundred twenty-eight million, seven hundred fifteen thousand, five hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •