Base | Representation |
---|---|
bin | 10000011101011101100… |
… | …000101010101000000000 |
3 | 11000010200110100001100022 |
4 | 100131131200222220000 |
5 | 122013041140240021 |
6 | 2223350240113012 |
7 | 144502555632446 |
oct | 20353540525000 |
9 | 4003613301308 |
10 | 1131145243136 |
11 | 3a6797001157 |
12 | 163282305768 |
13 | 8288850221c |
14 | 3ca67a6ab96 |
15 | 1e654deb1ab |
hex | 1075d82aa00 |
1131145243136 has 40 divisors (see below), whose sum is σ = 2338015084020. Its totient is φ = 546070110208.
The previous prime is 1131145243117. The next prime is 1131145243181. The reversal of 1131145243136 is 6313425411311.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 1123091257600 + 8053985536 = 1059760^2 + 89744^2 .
It is a super-2 number, since 2×11311452431362 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1131145243096 and 1131145243105.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 38075981 + ... + 38105676.
Almost surely, 21131145243136 is an apocalyptic number.
1131145243136 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
1131145243136 is an abundant number, since it is smaller than the sum of its proper divisors (1206869840884).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1131145243136 is an frugal number, since it uses more digits than its factorization.
1131145243136 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 76181704 (or 76181688 counting only the distinct ones).
The product of its digits is 25920, while the sum is 35.
The spelling of 1131145243136 in words is "one trillion, one hundred thirty-one billion, one hundred forty-five million, two hundred forty-three thousand, one hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •