Base | Representation |
---|---|
bin | 11000011000101011… |
… | …11111001001000000 |
3 | 1020210101220002221100 |
4 | 30030111333021000 |
5 | 203303022222003 |
6 | 10003034454400 |
7 | 642301045155 |
oct | 141425771100 |
9 | 36711802840 |
10 | 13091992128 |
11 | 56090a7506 |
12 | 2654594400 |
13 | 1308470607 |
14 | 8c2a7422c |
15 | 519573ba3 |
hex | 30c57f240 |
13091992128 has 168 divisors, whose sum is σ = 40580047872. Its totient is φ = 4019761152.
The previous prime is 13091992117. The next prime is 13091992129. The reversal of 13091992128 is 82129919031.
It is a super-2 number, since 2×130919921282 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (13091992129) 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, 446001 + ... + 474447.
It is an arithmetic number, because the mean of its divisors is an integer number (241547904).
Almost surely, 213091992128 is an apocalyptic number.
13091992128 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 13091992128, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (20290023936).
13091992128 is an abundant number, since it is smaller than the sum of its proper divisors (27488055744).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13091992128 is a wasteful number, since it uses less digits than its factorization.
13091992128 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28529 (or 28516 counting only the distinct ones).
The product of its (nonzero) digits is 69984, while the sum is 45.
The spelling of 13091992128 in words is "thirteen billion, ninety-one million, nine hundred ninety-two thousand, one hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •