Base | Representation |
---|---|
bin | 11000010100110100… |
… | …00000101101000000 |
3 | 1020201010201222001210 |
4 | 30022122000231000 |
5 | 203221212231142 |
6 | 5555514130120 |
7 | 641424566442 |
oct | 141232005500 |
9 | 36633658053 |
10 | 13059492672 |
11 | 55a181a156 |
12 | 2645720940 |
13 | 1301801a75 |
14 | 8bc614492 |
15 | 5167a449c |
hex | 30a680b40 |
13059492672 has 56 divisors (see below), whose sum is σ = 34622740000. Its totient is φ = 4344408576.
The previous prime is 13059492671. The next prime is 13059492727. The reversal of 13059492672 is 27629495031.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13059492671) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 27654 + ... + 163962.
Almost surely, 213059492672 is an apocalyptic number.
13059492672 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 13059492672, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17311370000).
13059492672 is an abundant number, since it is smaller than the sum of its proper divisors (21563247328).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13059492672 is a wasteful number, since it uses less digits than its factorization.
13059492672 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 136823 (or 136813 counting only the distinct ones).
The product of its (nonzero) digits is 816480, while the sum is 48.
The spelling of 13059492672 in words is "thirteen billion, fifty-nine million, four hundred ninety-two thousand, six hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •