Base | Representation |
---|---|
bin | 10000100001010111110… |
… | …111100010011101111000 |
3 | 11000112112011221101121010 |
4 | 100201113313202131320 |
5 | 122100141424334112 |
6 | 2225323123113520 |
7 | 145011630612651 |
oct | 20412767423570 |
9 | 4015464841533 |
10 | 1135345543032 |
11 | 3a8551a62688 |
12 | 164054b128a0 |
13 | 830a778458c |
14 | 3cd45840528 |
15 | 1e7eda3963c |
hex | 10857de2778 |
1135345543032 has 64 divisors (see below), whose sum is σ = 2855282814720. Its totient is φ = 376197820928.
The previous prime is 1135345543021. The next prime is 1135345543043. The reversal of 1135345543032 is 2303455435311.
It is an interprime number because it is at equal distance from previous prime (1135345543021) and next prime (1135345543043).
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, 3363808 + ... + 3685904.
It is an arithmetic number, because the mean of its divisors is an integer number (44613793980).
Almost surely, 21135345543032 is an apocalyptic number.
1135345543032 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1135345543032 is an abundant number, since it is smaller than the sum of its proper divisors (1719937271688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1135345543032 is a wasteful number, since it uses less digits than its factorization.
1135345543032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 322980 (or 322976 counting only the distinct ones).
The product of its (nonzero) digits is 324000, while the sum is 39.
It can be divided in two parts, 113534 and 5543032, that added together give a triangular number (5656566 = T3363).
The spelling of 1135345543032 in words is "one trillion, one hundred thirty-five billion, three hundred forty-five million, five hundred forty-three thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •