Base | Representation |
---|---|
bin | 11000001110011011… |
… | …11010110011110000 |
3 | 1020120102001210210000 |
4 | 30013031322303300 |
5 | 203114013204102 |
6 | 5550323310000 |
7 | 640205046360 |
oct | 140715726360 |
9 | 36512053700 |
10 | 13005991152 |
11 | 55745a7720 |
12 | 262b81b300 |
13 | 12c36bb96b |
14 | 8b54889a0 |
15 | 511c3701c |
hex | 30737acf0 |
13005991152 has 600 divisors, whose sum is σ = 48764200320. Its totient is φ = 3250264320.
The previous prime is 13005991129. The next prime is 13005991153. The reversal of 13005991152 is 25119950031.
13005991152 is a `hidden beast` number, since 1 + 3 + 0 + 0 + 599 + 11 + 52 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13005991153) by changing a digit.
It is a polite number, since it can be written in 119 ways as a sum of consecutive naturals, for example, 220440499 + ... + 220440557.
Almost surely, 213005991152 is an apocalyptic number.
13005991152 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 13005991152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (24382100160).
13005991152 is an abundant number, since it is smaller than the sum of its proper divisors (35758209168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13005991152 is a wasteful number, since it uses less digits than its factorization.
13005991152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 191 (or 129 counting only the distinct ones).
The product of its (nonzero) digits is 12150, while the sum is 36.
The spelling of 13005991152 in words is "thirteen billion, five million, nine hundred ninety-one thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •