Base | Representation |
---|---|
bin | 10000000110100001000… |
… | …000011100011100100001 |
3 | 10220210002102201110112100 |
4 | 100012201000130130201 |
5 | 121112112001441421 |
6 | 2204153411121013 |
7 | 142641203324544 |
oct | 20064100343441 |
9 | 3823072643470 |
10 | 1106507843361 |
11 | 3972a3916038 |
12 | 15a5472a3169 |
13 | 8046014416b |
14 | 3b7ab91085b |
15 | 1dbb1ea0c26 |
hex | 101a101c721 |
1106507843361 has 24 divisors (see below), whose sum is σ = 1600743246336. Its totient is φ = 736539935040.
The previous prime is 1106507843359. The next prime is 1106507843383. The reversal of 1106507843361 is 1633487056011.
1106507843361 is a `hidden beast` number, since 1 + 1 + 0 + 6 + 507 + 84 + 3 + 3 + 61 = 666.
It is not a de Polignac number, because 1106507843361 - 21 = 1106507843359 is a prime.
It is a super-2 number, since 2×11065078433612 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1106507843261) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 19509901 + ... + 19566533.
It is an arithmetic number, because the mean of its divisors is an integer number (66697635264).
Almost surely, 21106507843361 is an apocalyptic number.
It is an amenable number.
1106507843361 is a deficient number, since it is larger than the sum of its proper divisors (494235402975).
1106507843361 is a wasteful number, since it uses less digits than its factorization.
1106507843361 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59933 (or 59930 counting only the distinct ones).
The product of its (nonzero) digits is 362880, while the sum is 45.
The spelling of 1106507843361 in words is "one trillion, one hundred six billion, five hundred seven million, eight hundred forty-three thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •