Base | Representation |
---|---|
bin | 1011110110010011010110… |
… | …0000011011100011011000 |
3 | 1201010102100012122101102000 |
4 | 2331210311200123203120 |
5 | 3201420342034041210 |
6 | 43412433303041000 |
7 | 2513131265456064 |
oct | 275446540334330 |
9 | 51112305571360 |
10 | 13027533502680 |
11 | 4172a45042894 |
12 | 15649a6740160 |
13 | 736650051438 |
14 | 330770a60aa4 |
15 | 178d219a1ac0 |
hex | bd93581b8d8 |
13027533502680 has 64 divisors (see below), whose sum is σ = 43425111679200. Its totient is φ = 3474008933760.
The previous prime is 13027533502663. The next prime is 13027533502721. The reversal of 13027533502680 is 8620533572031.
13027533502680 is a `hidden beast` number, since 1 + 3 + 0 + 2 + 7 + 533 + 50 + 2 + 68 + 0 = 666.
13027533502680 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6031264431 + ... + 6031266590.
Almost surely, 213027533502680 is an apocalyptic number.
13027533502680 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13027533502680 is an abundant number, since it is smaller than the sum of its proper divisors (30397578176520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13027533502680 is a wasteful number, since it uses less digits than its factorization.
13027533502680 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12062531041 (or 12062531031 counting only the distinct ones).
The product of its (nonzero) digits is 907200, while the sum is 45.
The spelling of 13027533502680 in words is "thirteen trillion, twenty-seven billion, five hundred thirty-three million, five hundred two thousand, six hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •