Base | Representation |
---|---|
bin | 11001001100110001… |
… | …11111010010010000 |
3 | 1021220212011201220000 |
4 | 30212120333102100 |
5 | 210201410034033 |
6 | 10114245050000 |
7 | 656155330053 |
oct | 144630772220 |
9 | 37825151800 |
10 | 13528986768 |
11 | 5812840000 |
12 | 27569b6900 |
13 | 1377b6581b |
14 | 924b08a9a |
15 | 542ae3a13 |
hex | 32663f490 |
13528986768 has 500 divisors, whose sum is σ = 46394768640. Its totient is φ = 3794947200.
The previous prime is 13528986749. The next prime is 13528986769. The reversal of 13528986768 is 86768982531.
13528986768 is a `hidden beast` number, since 13 + 528 + 98 + 6 + 7 + 6 + 8 = 666.
Its product of digits (34836480) is a multiple of the sum of its prime divisors (70).
It is not an unprimeable number, because it can be changed into a prime (13528986769) by changing a digit.
It is a polite number, since it can be written in 99 ways as a sum of consecutive naturals, for example, 436418913 + ... + 436418943.
Almost surely, 213528986768 is an apocalyptic number.
13528986768 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 13528986768, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (23197384320).
13528986768 is an abundant number, since it is smaller than the sum of its proper divisors (32865781872).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13528986768 is an equidigital number, since it uses as much as digits as its factorization.
13528986768 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 118 (or 70 counting only the distinct ones).
The product of its digits is 34836480, while the sum is 63.
The spelling of 13528986768 in words is "thirteen billion, five hundred twenty-eight million, nine hundred eighty-six thousand, seven hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •