Base | Representation |
---|---|
bin | 1011111111101011001000… |
… | …0011011110111101110000 |
3 | 1201200210220210212012000000 |
4 | 2333322302003132331300 |
5 | 3212040110413401212 |
6 | 44014421415430000 |
7 | 2530561144421640 |
oct | 277726203367560 |
9 | 51623823765000 |
10 | 13188536856432 |
11 | 422525525a523 |
12 | 159003a385300 |
13 | 74889b1308b2 |
14 | 338485916520 |
15 | 17d0e65841dc |
hex | bfeb20def70 |
13188536856432 has 140 divisors (see below), whose sum is σ = 43784753779440. Its totient is φ = 3768153364224.
The previous prime is 13188536856389. The next prime is 13188536856461. The reversal of 13188536856432 is 23465863588131.
13188536856432 is a `hidden beast` number, since 1 + 3 + 1 + 8 + 8 + 5 + 3 + 68 + 564 + 3 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (63).
It is a self number, because there is not a number n which added to its sum of digits gives 13188536856432.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 27 ways as a sum of consecutive naturals, for example, 80682957 + ... + 80846252.
Almost surely, 213188536856432 is an apocalyptic number.
13188536856432 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
13188536856432 is an abundant number, since it is smaller than the sum of its proper divisors (30596216923008).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13188536856432 is an equidigital number, since it uses as much as digits as its factorization.
13188536856432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 161529242 (or 161529221 counting only the distinct ones).
The product of its digits is 99532800, while the sum is 63.
The spelling of 13188536856432 in words is "thirteen trillion, one hundred eighty-eight billion, five hundred thirty-six million, eight hundred fifty-six thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •