Base | Representation |
---|---|
bin | 10000011110010011101… |
… | …001100110001110010111 |
3 | 11000020000202111000201001 |
4 | 100132103221212032113 |
5 | 122021421202212241 |
6 | 2224020324244131 |
7 | 144534225304336 |
oct | 20362351461627 |
9 | 4006022430631 |
10 | 1132053554071 |
11 | 3a711279a650 |
12 | 163496540647 |
13 | 829a174870b |
14 | 3cb1254bd1d |
15 | 1e6a9a1a431 |
hex | 10793a66397 |
1132053554071 has 16 divisors (see below), whose sum is σ = 1239739338240. Its totient is φ = 1025165473920.
The previous prime is 1132053554059. The next prime is 1132053554081. The reversal of 1132053554071 is 1704553502311.
It is a cyclic number.
It is not a de Polignac number, because 1132053554071 - 29 = 1132053553559 is a prime.
It is a super-3 number, since 3×11320535540713 (a number of 37 digits) contains 333 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1132053554071.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1132053554081) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 9651151 + ... + 9767743.
It is an arithmetic number, because the mean of its divisors is an integer number (77483708640).
Almost surely, 21132053554071 is an apocalyptic number.
1132053554071 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1132053554071 is a deficient number, since it is larger than the sum of its proper divisors (107685784169).
1132053554071 is a wasteful number, since it uses less digits than its factorization.
1132053554071 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 120006.
The product of its (nonzero) digits is 63000, while the sum is 37.
The spelling of 1132053554071 in words is "one trillion, one hundred thirty-two billion, fifty-three million, five hundred fifty-four thousand, seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •