Base | Representation |
---|---|
bin | 11001100111111011… |
… | …00110011011000000 |
3 | 1022111201122011100100 |
4 | 30303331212123000 |
5 | 211133203004224 |
6 | 10153021322400 |
7 | 664621630200 |
oct | 146375463300 |
9 | 38451564310 |
10 | 13756688064 |
11 | 591a323399 |
12 | 27bb106400 |
13 | 13b309b712 |
14 | 94705c400 |
15 | 557ac0ac9 |
hex | 333f666c0 |
13756688064 has 252 divisors, whose sum is σ = 46001760168. Its totient is φ = 3919104000.
The previous prime is 13756688059. The next prime is 13756688083. The reversal of 13756688064 is 46088665731.
13756688064 is a `hidden beast` number, since 13 + 7 + 566 + 8 + 8 + 0 + 64 = 666.
It is a tau number, because it is divible by the number of its divisors (252).
It is a self number, because there is not a number n which added to its sum of digits gives 13756688064.
It is an unprimeable number.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 16962219 + ... + 16963029.
Almost surely, 213756688064 is an apocalyptic number.
13756688064 is a gapful number since it is divisible by the number (14) 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 13756688064, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (23000880084).
13756688064 is an abundant number, since it is smaller than the sum of its proper divisors (32245072104).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13756688064 is a wasteful number, since it uses less digits than its factorization.
13756688064 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1444 (or 1424 counting only the distinct ones).
The product of its (nonzero) digits is 5806080, while the sum is 54.
The spelling of 13756688064 in words is "thirteen billion, seven hundred fifty-six million, six hundred eighty-eight thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •