Base | Representation |
---|---|
bin | 11000101101100001… |
… | …10010100001100000 |
3 | 1021020120210210012222 |
4 | 30112300302201200 |
5 | 204132244243441 |
6 | 10032241210212 |
7 | 646522600331 |
oct | 142660624140 |
9 | 37216723188 |
10 | 13266790496 |
11 | 5698837073 |
12 | 26a3030968 |
13 | 13357429bb |
14 | 8dbd76288 |
15 | 529aa0d4b |
hex | 316c32860 |
13266790496 has 48 divisors (see below), whose sum is σ = 26773286400. Its totient is φ = 6467435520.
The previous prime is 13266790477. The next prime is 13266790513. The reversal of 13266790496 is 69409766231.
It is a congruent number.
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 7 ways as a sum of consecutive naturals, for example, 3342305 + ... + 3346271.
It is an arithmetic number, because the mean of its divisors is an integer number (557776800).
Almost surely, 213266790496 is an apocalyptic number.
13266790496 is a gapful number since it is divisible by the number (16) 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 13266790496, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13386643200).
13266790496 is an abundant number, since it is smaller than the sum of its proper divisors (13506495904).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13266790496 is a wasteful number, since it uses less digits than its factorization.
13266790496 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6567 (or 6559 counting only the distinct ones).
The product of its (nonzero) digits is 2939328, while the sum is 53.
The spelling of 13266790496 in words is "thirteen billion, two hundred sixty-six million, seven hundred ninety thousand, four hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •