Base | Representation |
---|---|
bin | 11000110011111111… |
… | …11000110110000000 |
3 | 1021101100221222200110 |
4 | 30121333320312000 |
5 | 204240144031232 |
6 | 10041500551320 |
7 | 651052212330 |
oct | 143177706600 |
9 | 37340858613 |
10 | 13321080192 |
11 | 5716447792 |
12 | 26b9252540 |
13 | 1343a70794 |
14 | 9052690c0 |
15 | 52e726acc |
hex | 319ff8d80 |
13321080192 has 128 divisors (see below), whose sum is σ = 40477190400. Its totient is φ = 3802429440.
The previous prime is 13321080173. The next prime is 13321080193. The reversal of 13321080192 is 29108012331.
It is a tau number, because it is divible by the number of its divisors (128).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13321080193) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4350342 + ... + 4353402.
It is an arithmetic number, because the mean of its divisors is an integer number (316228050).
Almost surely, 213321080192 is an apocalyptic number.
13321080192 is a gapful number since it is divisible by the number (12) 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 13321080192, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (20238595200).
13321080192 is an abundant number, since it is smaller than the sum of its proper divisors (27156110208).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13321080192 is a wasteful number, since it uses less digits than its factorization.
13321080192 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4704 (or 4692 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 30.
The spelling of 13321080192 in words is "thirteen billion, three hundred twenty-one million, eighty thousand, one hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •