Base | Representation |
---|---|
bin | 10000111001101011001… |
… | …110100000000100100000 |
3 | 11010000212202111221010100 |
4 | 100321223032200010200 |
5 | 123012112133232113 |
6 | 2245320324502400 |
7 | 146624366146632 |
oct | 20715316400440 |
9 | 4100782457110 |
10 | 1161440133408 |
11 | 408622749655 |
12 | 169117b4aa00 |
13 | 856a59c63b9 |
14 | 402dd318a52 |
15 | 20329874d73 |
hex | 10e6b3a0120 |
1161440133408 has 36 divisors (see below), whose sum is σ = 3302845380198. Its totient is φ = 387146711040.
The previous prime is 1161440133319. The next prime is 1161440133443. The reversal of 1161440133408 is 8043310441611.
1161440133408 is a `hidden beast` number, since 1 + 1 + 614 + 4 + 0 + 1 + 3 + 34 + 0 + 8 = 666.
It can be written as a sum of positive squares in only one way, i.e., 1051420550544 + 110019582864 = 1025388^2 + 331692^2 .
It is a tau number, because it is divible by the number of its divisors (36).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 2016388833 + ... + 2016389408.
Almost surely, 21161440133408 is an apocalyptic number.
1161440133408 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
1161440133408 is an abundant number, since it is smaller than the sum of its proper divisors (2141405246790).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1161440133408 is a wasteful number, since it uses less digits than its factorization.
1161440133408 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4032778257 (or 4032778246 counting only the distinct ones).
The product of its (nonzero) digits is 27648, while the sum is 36.
The spelling of 1161440133408 in words is "one trillion, one hundred sixty-one billion, four hundred forty million, one hundred thirty-three thousand, four hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •