Base | Representation |
---|---|
bin | 1010000110101101111000… |
… | …1110000000011111011000 |
3 | 1110100011011210120100021020 |
4 | 2201223132032000133120 |
5 | 2424013312443011212 |
6 | 35344033254242440 |
7 | 2224464612504552 |
oct | 241533616003730 |
9 | 43304153510236 |
10 | 11110513641432 |
11 | 35a3a40333477 |
12 | 12b5360656420 |
13 | 6279421711aa |
14 | 2a5a74a624d2 |
15 | 144023911d8c |
hex | a1ade3807d8 |
11110513641432 has 16 divisors (see below), whose sum is σ = 27776284103640. Its totient is φ = 3703504547136.
The previous prime is 11110513641413. The next prime is 11110513641467. The reversal of 11110513641432 is 23414631501111.
It is a junction number, because it is equal to n+sod(n) for n = 11110513641393 and 11110513641402.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 231469034173 + ... + 231469034220.
Almost surely, 211110513641432 is an apocalyptic number.
11110513641432 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11110513641432 is an abundant number, since it is smaller than the sum of its proper divisors (16665770462208).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11110513641432 is a wasteful number, since it uses less digits than its factorization.
11110513641432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 462938068402 (or 462938068398 counting only the distinct ones).
The product of its (nonzero) digits is 8640, while the sum is 33.
The spelling of 11110513641432 in words is "eleven trillion, one hundred ten billion, five hundred thirteen million, six hundred forty-one thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •