Base | Representation |
---|---|
bin | 11000111101000010… |
… | …00111101100000000 |
3 | 1021120122122001202000 |
4 | 30132201013230000 |
5 | 204414101304413 |
6 | 10053210024000 |
7 | 652662530160 |
oct | 143641075400 |
9 | 37518561660 |
10 | 13396900608 |
11 | 5755223793 |
12 | 271a718000 |
13 | 1356699630 |
14 | 9113645a0 |
15 | 536202073 |
hex | 31e847b00 |
13396900608 has 864 divisors, whose sum is σ = 52332940800. Its totient is φ = 3290554368.
The previous prime is 13396900607. The next prime is 13396900613. The reversal of 13396900608 is 80600969331.
13396900608 is a `hidden beast` number, since 1 + 3 + 39 + 6 + 9 + 0 + 0 + 608 = 666.
It is a tau number, because it is divible by the number of its divisors (864).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13396900607) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 227066083 + ... + 227066141.
Almost surely, 213396900608 is an apocalyptic number.
13396900608 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 13396900608, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (26166470400).
13396900608 is an abundant number, since it is smaller than the sum of its proper divisors (38936040192).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13396900608 is a wasteful number, since it uses less digits than its factorization.
13396900608 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 142 (or 103 counting only the distinct ones).
The product of its (nonzero) digits is 209952, while the sum is 45.
The spelling of 13396900608 in words is "thirteen billion, three hundred ninety-six million, nine hundred thousand, six hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •