Base | Representation |
---|---|
bin | 10000011110011010100… |
… | …000010000001100011101 |
3 | 11000020022202212011200022 |
4 | 100132122200100030131 |
5 | 122022140121420203 |
6 | 2224035553041525 |
7 | 144540122564120 |
oct | 20363240201435 |
9 | 4006282764608 |
10 | 1132168545053 |
11 | 3a71716a0017 |
12 | 163508b562a5 |
13 | 829bc50a710 |
14 | 3cb239223b7 |
15 | 1e6b4b81a38 |
hex | 1079a81031d |
1132168545053 has 64 divisors (see below), whose sum is σ = 1528302504960. Its totient is φ = 812938678272.
The previous prime is 1132168545049. The next prime is 1132168545061. The reversal of 1132168545053 is 3505458612311.
It is not a de Polignac number, because 1132168545053 - 22 = 1132168545049 is a prime.
It is a super-2 number, since 2×11321685450532 (a number of 25 digits) contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1132168544995 and 1132168545013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1132168545043) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 34662776 + ... + 34695422.
It is an arithmetic number, because the mean of its divisors is an integer number (23879726640).
Almost surely, 21132168545053 is an apocalyptic number.
1132168545053 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
1132168545053 is a deficient number, since it is larger than the sum of its proper divisors (396133959907).
1132168545053 is a wasteful number, since it uses less digits than its factorization.
1132168545053 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 33486.
The product of its (nonzero) digits is 432000, while the sum is 44.
The spelling of 1132168545053 in words is "one trillion, one hundred thirty-two billion, one hundred sixty-eight million, five hundred forty-five thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •