Base | Representation |
---|---|
bin | 10000011110011000011… |
… | …000110101000100100000 |
3 | 11000020020022001120002110 |
4 | 100132120120311010200 |
5 | 122022102024411022 |
6 | 2224032244115320 |
7 | 144536212046031 |
oct | 20363030650440 |
9 | 4006208046073 |
10 | 1132133044512 |
11 | 3a7153652a28 |
12 | 1634b9095b40 |
13 | 829b505ab92 |
14 | 3cb1cd20a88 |
15 | 1e6b19bd00c |
hex | 10798635120 |
1132133044512 has 48 divisors (see below), whose sum is σ = 2974510086912. Its totient is φ = 377039796480.
The previous prime is 1132133044507. The next prime is 1132133044579. The reversal of 1132133044512 is 2154403312311.
It is a tau number, because it is divible by the number of its divisors (48).
It is a self number, because there is not a number n which added to its sum of digits gives 1132133044512.
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, 5171664 + ... + 5386127.
It is an arithmetic number, because the mean of its divisors is an integer number (61968960144).
Almost surely, 21132133044512 is an apocalyptic number.
1132133044512 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1132133044512 is an abundant number, since it is smaller than the sum of its proper divisors (1842377042400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1132133044512 is a wasteful number, since it uses less digits than its factorization.
1132133044512 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10558921 (or 10558913 counting only the distinct ones).
The product of its (nonzero) digits is 8640, while the sum is 30.
Adding to 1132133044512 its reverse (2154403312311), we get a palindrome (3286536356823).
The spelling of 1132133044512 in words is "one trillion, one hundred thirty-two billion, one hundred thirty-three million, forty-four thousand, five hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •