Base | Representation |
---|---|
bin | 1011111000010001100100… |
… | …1101111100010000010000 |
3 | 1201020122210201111022120100 |
4 | 2332010121031330100100 |
5 | 3202444241132212313 |
6 | 43440155523012400 |
7 | 2515441062353142 |
oct | 276043115742020 |
9 | 51218721438510 |
10 | 13061418632208 |
11 | 4186353342171 |
12 | 156b48280a100 |
13 | 7398c02b8a3b |
14 | 33226707ac92 |
15 | 179b56710173 |
hex | be11937c410 |
13061418632208 has 60 divisors (see below), whose sum is σ = 37541772713068. Its totient is φ = 4236135770880.
The previous prime is 13061418632161. The next prime is 13061418632261. The reversal of 13061418632208 is 80223681416031.
13061418632208 is a `hidden beast` number, since 1 + 3 + 0 + 6 + 1 + 4 + 1 + 8 + 632 + 2 + 0 + 8 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 11743725855744 + 1317692776464 = 3426912^2 + 1147908^2 .
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1225728403 + ... + 1225739058.
Almost surely, 213061418632208 is an apocalyptic number.
13061418632208 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
13061418632208 is an abundant number, since it is smaller than the sum of its proper divisors (24480354080860).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13061418632208 is a wasteful number, since it uses less digits than its factorization.
13061418632208 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2451467512 (or 2451467503 counting only the distinct ones).
The product of its (nonzero) digits is 331776, while the sum is 45.
The spelling of 13061418632208 in words is "thirteen trillion, sixty-one billion, four hundred eighteen million, six hundred thirty-two thousand, two hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •