Base | Representation |
---|---|
bin | 11000111001010100… |
… | …11101000110000000 |
3 | 1021111111002122100000 |
4 | 30130222131012000 |
5 | 204333120340102 |
6 | 10050135200000 |
7 | 652134236655 |
oct | 143452350600 |
9 | 37444078300 |
10 | 13365793152 |
11 | 5739707248 |
12 | 2710216000 |
13 | 13500c755a |
14 | 90b187c2c |
15 | 53360a01c |
hex | 31ca9d180 |
13365793152 has 192 divisors, whose sum is σ = 40008018960. Its totient is φ = 4441651200.
The previous prime is 13365793117. The next prime is 13365793163. The reversal of 13365793152 is 25139756331.
13365793152 is a `hidden beast` number, since 13 + 36 + 579 + 31 + 5 + 2 = 666.
It is a tau number, because it is divible by the number of its divisors (192).
It is a junction number, because it is equal to n+sod(n) for n = 13365793098 and 13365793107.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 19066402 + ... + 19067102.
Almost surely, 213365793152 is an apocalyptic number.
13365793152 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 13365793152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (20004009480).
13365793152 is an abundant number, since it is smaller than the sum of its proper divisors (26642225808).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13365793152 is an frugal number, since it uses more digits than its factorization.
13365793152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1343 (or 1319 counting only the distinct ones).
The product of its digits is 510300, while the sum is 45.
The spelling of 13365793152 in words is "thirteen billion, three hundred sixty-five million, seven hundred ninety-three thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •