Base | Representation |
---|---|
bin | 10111111011100110… |
… | …11110100101011001 |
3 | 1020011101220022121222 |
4 | 23331303132211121 |
5 | 202303101033412 |
6 | 5522522341425 |
7 | 633246515015 |
oct | 137563364531 |
9 | 36141808558 |
10 | 12848064857 |
11 | 54a3441321 |
12 | 25a695a875 |
13 | 1299a76054 |
14 | 89c4d9545 |
15 | 502e3e072 |
hex | 2fdcde959 |
12848064857 has 8 divisors (see below), whose sum is σ = 13724223336. Its totient is φ = 11985283072.
The previous prime is 12848064847. The next prime is 12848064899. The reversal of 12848064857 is 75846084821.
It can be written as a sum of positive squares in 4 ways, for example, as 3153496336 + 9694568521 = 56156^2 + 98461^2 .
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 12848064857 - 212 = 12848060761 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12848064799 and 12848064808.
It is not an unprimeable number, because it can be changed into a prime (12848064847) 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, 3342188 + ... + 3346029.
It is an arithmetic number, because the mean of its divisors is an integer number (1715527917).
Almost surely, 212848064857 is an apocalyptic number.
12848064857 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
It is an amenable number.
12848064857 is a deficient number, since it is larger than the sum of its proper divisors (876158479).
12848064857 is a wasteful number, since it uses less digits than its factorization.
12848064857 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6688347.
The product of its (nonzero) digits is 3440640, while the sum is 53.
The spelling of 12848064857 in words is "twelve billion, eight hundred forty-eight million, sixty-four thousand, eight hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •