Base | Representation |
---|---|
bin | 10000000011100010100… |
… | …001010100000000111000 |
3 | 10220110211201012101010200 |
4 | 100003202201110000320 |
5 | 121034040333330240 |
6 | 2202504325242200 |
7 | 142466046234141 |
oct | 20034241240070 |
9 | 3813751171120 |
10 | 1103312011320 |
11 | 395a0395a132 |
12 | 1599b4b63360 |
13 | 8007100479c |
14 | 3b5872ccac8 |
15 | 1da76627930 |
hex | 100e2854038 |
1103312011320 has 48 divisors (see below), whose sum is σ = 3585764037960. Its totient is φ = 294216536256.
The previous prime is 1103312011297. The next prime is 1103312011357. The reversal of 1103312011320 is 231102133011.
1103312011320 is a `hidden beast` number, since 1 + 1 + 0 + 331 + 2 + 0 + 11 + 320 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 1103312011293 and 1103312011302.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1532377434 + ... + 1532378153.
Almost surely, 21103312011320 is an apocalyptic number.
1103312011320 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1103312011320 is an abundant number, since it is smaller than the sum of its proper divisors (2482452026640).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1103312011320 is a wasteful number, since it uses less digits than its factorization.
1103312011320 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3064755604 (or 3064755597 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 1103312011320 its reverse (231102133011), we get a palindrome (1334414144331).
The spelling of 1103312011320 in words is "one trillion, one hundred three billion, three hundred twelve million, eleven thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •