Base | Representation |
---|---|
bin | 11000010010100000… |
… | …10010001000000000 |
3 | 1020122210101001000000 |
4 | 30021100102020000 |
5 | 203201240243001 |
6 | 5553544000000 |
7 | 641101401600 |
oct | 141120221000 |
9 | 36583331000 |
10 | 13040165376 |
11 | 5591919287 |
12 | 263b160000 |
13 | 12ca7c58b4 |
14 | 8b9c22c00 |
15 | 514c37a86 |
hex | 309412200 |
13040165376 has 840 divisors, whose sum is σ = 48947652864. Its totient is φ = 3448811520.
The previous prime is 13040165297. The next prime is 13040165381. The reversal of 13040165376 is 67356104031.
13040165376 is a `hidden beast` number, since 130 + 401 + 6 + 53 + 76 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a self number, because there is not a number n which added to its sum of digits gives 13040165376.
It is an unprimeable number.
It is a polite number, since it can be written in 83 ways as a sum of consecutive naturals, for example, 420650481 + ... + 420650511.
Almost surely, 213040165376 is an apocalyptic number.
13040165376 is a gapful number since it is divisible by the number (16) 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 13040165376, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (24473826432).
13040165376 is an abundant number, since it is smaller than the sum of its proper divisors (35907487488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13040165376 is an frugal number, since it uses more digits than its factorization.
13040165376 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 104 (or 66 counting only the distinct ones).
The product of its (nonzero) digits is 45360, while the sum is 36.
The spelling of 13040165376 in words is "thirteen billion, forty million, one hundred sixty-five thousand, three hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •