Base | Representation |
---|---|
bin | 10000010000000111001… |
… | …111101011000011001000 |
3 | 10221202200121202222220200 |
4 | 100100013033223003020 |
5 | 121244213114432320 |
6 | 2213020135252200 |
7 | 143454445155153 |
oct | 20200717530310 |
9 | 3852617688820 |
10 | 1116813045960 |
11 | 3a07019382a7 |
12 | 16054251a060 |
13 | 81413131491 |
14 | 3c0a83dcc9a |
15 | 1e0b6a49290 |
hex | 104073eb0c8 |
1116813045960 has 48 divisors (see below), whose sum is σ = 3629642400540. Its totient is φ = 297816812160.
The previous prime is 1116813045899. The next prime is 1116813045967. The reversal of 1116813045960 is 695403186111.
1116813045960 is a `hidden beast` number, since 1 + 1 + 1 + 6 + 8 + 130 + 459 + 60 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 1107836241444 + 8976804516 = 1052538^2 + 94746^2 .
It is a Harshad number since it is a multiple of its sum of digits (45).
It is not an unprimeable number, because it can be changed into a prime (1116813045967) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1551128871 + ... + 1551129590.
Almost surely, 21116813045960 is an apocalyptic number.
1116813045960 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1116813045960 is an abundant number, since it is smaller than the sum of its proper divisors (2512829354580).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1116813045960 is a wasteful number, since it uses less digits than its factorization.
1116813045960 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3102258478 (or 3102258471 counting only the distinct ones).
The product of its (nonzero) digits is 155520, while the sum is 45.
The spelling of 1116813045960 in words is "one trillion, one hundred sixteen billion, eight hundred thirteen million, forty-five thousand, nine hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •