Base | Representation |
---|---|
bin | 11000010000110111… |
… | …11101010010000000 |
3 | 1020121211120011000000 |
4 | 30020123331102000 |
5 | 203134232323022 |
6 | 5552334000000 |
7 | 640543662000 |
oct | 141033752200 |
9 | 36554504000 |
10 | 13026448512 |
11 | 55850aa630 |
12 | 2636646000 |
13 | 12c7a022cc |
14 | 8b8092000 |
15 | 5139286ac |
hex | 3086fd480 |
13026448512 has 896 divisors, whose sum is σ = 50837616000. Its totient is φ = 3292047360.
The previous prime is 13026448481. The next prime is 13026448531. The reversal of 13026448512 is 21584462031.
It is a happy number.
13026448512 is a `hidden beast` number, since 1 + 3 + 0 + 2 + 644 + 8 + 5 + 1 + 2 = 666.
It is a tau number, because it is divible by the number of its divisors (896).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a polite number, since it can be written in 111 ways as a sum of consecutive naturals, for example, 352066158 + ... + 352066194.
Almost surely, 213026448512 is an apocalyptic number.
13026448512 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 13026448512, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (25418808000).
13026448512 is an abundant number, since it is smaller than the sum of its proper divisors (37811167488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13026448512 is an frugal number, since it uses more digits than its factorization.
13026448512 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 101 (or 60 counting only the distinct ones).
The product of its (nonzero) digits is 46080, while the sum is 36.
The spelling of 13026448512 in words is "thirteen billion, twenty-six million, four hundred forty-eight thousand, five hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •