Base | Representation |
---|---|
bin | 10000010100000111000… |
… | …001110000101011110111 |
3 | 10222011202200122122210001 |
4 | 100110013001300223313 |
5 | 121332010204210302 |
6 | 2215010033212131 |
7 | 143666003611231 |
oct | 20240701605367 |
9 | 3864680578701 |
10 | 1121104366327 |
11 | 3a2504207860 |
12 | 16133b701047 |
13 | 819482020ba |
14 | 3c394307251 |
15 | 1e268666787 |
hex | 10507070af7 |
1121104366327 has 8 divisors (see below), whose sum is σ = 1224408032640. Its totient is φ = 1018031547960.
The previous prime is 1121104366313. The next prime is 1121104366357. The reversal of 1121104366327 is 7236634011211.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1121104366327 is a prime.
It is a super-2 number, since 2×11211043663272 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1121104366357) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 57701827 + ... + 57721252.
It is an arithmetic number, because the mean of its divisors is an integer number (153051004080).
Almost surely, 21121104366327 is an apocalyptic number.
1121104366327 is a deficient number, since it is larger than the sum of its proper divisors (103303666313).
1121104366327 is a wasteful number, since it uses less digits than its factorization.
1121104366327 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 115423973.
The product of its (nonzero) digits is 36288, while the sum is 37.
Adding to 1121104366327 its reverse (7236634011211), we get a palindrome (8357738377538).
The spelling of 1121104366327 in words is "one trillion, one hundred twenty-one billion, one hundred four million, three hundred sixty-six thousand, three hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •