Base | Representation |
---|---|
bin | 10111111011011010… |
… | …00000000000001000 |
3 | 1020011021201001020022 |
4 | 23331231000000020 |
5 | 202302132213403 |
6 | 5522422120012 |
7 | 633226213136 |
oct | 137555000010 |
9 | 36137631208 |
10 | 12846366728 |
11 | 54a2491508 |
12 | 25a6280008 |
13 | 1299600140 |
14 | 89c1b6756 |
15 | 502c05d38 |
hex | 2fdb40008 |
12846366728 has 16 divisors (see below), whose sum is σ = 25939779180. Its totient is φ = 5929092288.
The previous prime is 12846366713. The next prime is 12846366751. The reversal of 12846366728 is 82766364821.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 12827374564 + 18992164 = 113258^2 + 4358^2 .
It is a super-2 number, since 2×128463667282 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 12846366728.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 61761275 + ... + 61761482.
Almost surely, 212846366728 is an apocalyptic number.
It is an amenable number.
12846366728 is an abundant number, since it is smaller than the sum of its proper divisors (13093412452).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12846366728 is a wasteful number, since it uses less digits than its factorization.
12846366728 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 123522776 (or 123522772 counting only the distinct ones).
The product of its digits is 4644864, while the sum is 53.
It can be divided in two parts, 1284636672 and 8, that multiplied together give a square (10277093376 = 1013762).
The spelling of 12846366728 in words is "twelve billion, eight hundred forty-six million, three hundred sixty-six thousand, seven hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •