Base | Representation |
---|---|
bin | 10000000011100111110… |
… | …010001100000100101111 |
3 | 10220111001212100222200200 |
4 | 100003213302030010233 |
5 | 121034230440240302 |
6 | 2202521202124543 |
7 | 142501200660543 |
oct | 20034762140457 |
9 | 3814055328620 |
10 | 1103400321327 |
11 | 395a49796807 |
12 | 159a1a650753 |
13 | 800863b4425 |
14 | 3b594d19a23 |
15 | 1da7e26d81c |
hex | 100e7c8c12f |
1103400321327 has 24 divisors (see below), whose sum is σ = 1631238008400. Its totient is φ = 718329161088.
The previous prime is 1103400321293. The next prime is 1103400321341. The reversal of 1103400321327 is 7231230043011.
It is a happy number.
1103400321327 is a `hidden beast` number, since 1 + 10 + 3 + 4 + 0 + 0 + 321 + 327 = 666.
It is not a de Polignac number, because 1103400321327 - 211 = 1103400319279 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1103400321327.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1103400321377) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1382949 + ... + 2029617.
It is an arithmetic number, because the mean of its divisors is an integer number (67968250350).
Almost surely, 21103400321327 is an apocalyptic number.
1103400321327 is a deficient number, since it is larger than the sum of its proper divisors (527837687073).
1103400321327 is a wasteful number, since it uses less digits than its factorization.
1103400321327 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 651127 (or 651124 counting only the distinct ones).
The product of its (nonzero) digits is 3024, while the sum is 27.
Adding to 1103400321327 its reverse (7231230043011), we get a palindrome (8334630364338).
The spelling of 1103400321327 in words is "one trillion, one hundred three billion, four hundred million, three hundred twenty-one thousand, three hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •