Base | Representation |
---|---|
bin | 11000100101001010… |
… | …11010000000000000 |
3 | 1021001200220200211210 |
4 | 30102211122000000 |
5 | 204011323310400 |
6 | 10021255010120 |
7 | 645012036012 |
oct | 142245320000 |
9 | 37050820753 |
10 | 13196697600 |
11 | 5662212259 |
12 | 2683669940 |
13 | 1324070b08 |
14 | 8d292c1b2 |
15 | 523857950 |
hex | 31295a000 |
13196697600 has 336 divisors, whose sum is σ = 44660320128. Its totient is φ = 3436707840.
The previous prime is 13196697581. The next prime is 13196697601. The reversal of 13196697600 is 679669131.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a self number, because there is not a number n which added to its sum of digits gives 13196697600.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13196697601) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 28876572 + ... + 28877028.
Almost surely, 213196697600 is an apocalyptic number.
13196697600 is a gapful number since it is divisible by the number (10) 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 13196697600, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (22330160064).
13196697600 is an abundant number, since it is smaller than the sum of its proper divisors (31463622528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13196697600 is an equidigital number, since it uses as much as digits as its factorization.
13196697600 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 543 (or 514 counting only the distinct ones).
The product of its (nonzero) digits is 367416, while the sum is 48.
The spelling of 13196697600 in words is "thirteen billion, one hundred ninety-six million, six hundred ninety-seven thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •