Base | Representation |
---|---|
bin | 11000100100010111… |
… | …11010000000000000 |
3 | 1021001020100002012100 |
4 | 30102023322000000 |
5 | 204003120403203 |
6 | 10020455430400 |
7 | 644601155121 |
oct | 142213720000 |
9 | 37036302170 |
10 | 13190012928 |
11 | 5659466a34 |
12 | 2681385400 |
13 | 13228702a1 |
14 | 8d1aac048 |
15 | 522e86ea3 |
hex | 3122fa000 |
13190012928 has 336 divisors, whose sum is σ = 40891968000. Its totient is φ = 4087480320.
The previous prime is 13190012911. The next prime is 13190012963. The reversal of 13190012928 is 82921009131.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 13190012892 and 13190012901.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 66281373 + ... + 66281571.
Almost surely, 213190012928 is an apocalyptic number.
13190012928 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 13190012928, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (20445984000).
13190012928 is an abundant number, since it is smaller than the sum of its proper divisors (27701955072).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13190012928 is a wasteful number, since it uses less digits than its factorization.
13190012928 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 291 (or 264 counting only the distinct ones).
The product of its (nonzero) digits is 7776, while the sum is 36.
The spelling of 13190012928 in words is "thirteen billion, one hundred ninety million, twelve thousand, nine hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •