Base | Representation |
---|---|
bin | 1011111010110001101111… |
… | …0000111011111101011000 |
3 | 1201101202202221021120211210 |
4 | 2332230123300323331120 |
5 | 3204200313211032212 |
6 | 43512025555223120 |
7 | 2521522343630565 |
oct | 276543360737530 |
9 | 51352687246753 |
10 | 13104411033432 |
11 | 41a2605440574 |
12 | 15778808a7aa0 |
13 | 7409822c1bc4 |
14 | 334384c3386c |
15 | 17ad20c8953c |
hex | beb1bc3bf58 |
13104411033432 has 32 divisors (see below), whose sum is σ = 32898103027200. Its totient is φ = 4349860285344.
The previous prime is 13104411033421. The next prime is 13104411033521. The reversal of 13104411033432 is 23433011440131.
It is a self number, because there is not a number n which added to its sum of digits gives 13104411033432.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1142289508 + ... + 1142300979.
It is an arithmetic number, because the mean of its divisors is an integer number (1028065719600).
Almost surely, 213104411033432 is an apocalyptic number.
13104411033432 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
13104411033432 is an abundant number, since it is smaller than the sum of its proper divisors (19793691993768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13104411033432 is a wasteful number, since it uses less digits than its factorization.
13104411033432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2284590735 (or 2284590731 counting only the distinct ones).
The product of its (nonzero) digits is 10368, while the sum is 30.
Adding to 13104411033432 its reverse (23433011440131), we get a palindrome (36537422473563).
The spelling of 13104411033432 in words is "thirteen trillion, one hundred four billion, four hundred eleven million, thirty-three thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •