Base | Representation |
---|---|
bin | 11000011110010011… |
… | …10110000000000000 |
3 | 1020220200121111111100 |
4 | 30033021312000000 |
5 | 203402104444413 |
6 | 10011441214400 |
7 | 643412565246 |
oct | 141711660000 |
9 | 36820544440 |
10 | 13139140608 |
11 | 563277a8a0 |
12 | 2668331400 |
13 | 131516ab19 |
14 | 8c9028796 |
15 | 51d788a73 |
hex | 30f276000 |
13139140608 has 336 divisors, whose sum is σ = 43887304656. Its totient is φ = 3743416320.
The previous prime is 13139140603. The next prime is 13139140621. The reversal of 13139140608 is 80604193131.
13139140608 is a `hidden beast` number, since 1 + 3 + 1 + 3 + 9 + 1 + 40 + 608 = 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 (13139140603) 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, 13786660 + ... + 13787612.
Almost surely, 213139140608 is an apocalyptic number.
13139140608 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 13139140608, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (21943652328).
13139140608 is an abundant number, since it is smaller than the sum of its proper divisors (30748164048).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13139140608 is a wasteful number, since it uses less digits than its factorization.
13139140608 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1013 (or 986 counting only the distinct ones).
The product of its (nonzero) digits is 15552, while the sum is 36.
The spelling of 13139140608 in words is "thirteen billion, one hundred thirty-nine million, one hundred forty thousand, six hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •