Base | Representation |
---|---|
bin | 10000000100110000100… |
… | …000111000101010000001 |
3 | 10220121012220101121111101 |
4 | 100010300200320222001 |
5 | 121044230323201423 |
6 | 2203242231214401 |
7 | 142543345342333 |
oct | 20046040705201 |
9 | 3817186347441 |
10 | 1104620522113 |
11 | 39651553a709 |
12 | 15a0bb217401 |
13 | 8021c12c524 |
14 | 3b66cdc7453 |
15 | 1db014497ad |
hex | 10130838a81 |
1104620522113 has 4 divisors (see below), whose sum is σ = 1104984246100. Its totient is φ = 1104256798128.
The previous prime is 1104620522111. The next prime is 1104620522143. The reversal of 1104620522113 is 3112250264011.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1027776246849 + 76844275264 = 1013793^2 + 277208^2 .
It is a cyclic number.
It is not a de Polignac number, because 1104620522113 - 21 = 1104620522111 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1104620522111) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 181857438 + ... + 181863511.
It is an arithmetic number, because the mean of its divisors is an integer number (276246061525).
Almost surely, 21104620522113 is an apocalyptic number.
It is an amenable number.
1104620522113 is a deficient number, since it is larger than the sum of its proper divisors (363723987).
1104620522113 is an equidigital number, since it uses as much as digits as its factorization.
1104620522113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 363723986.
The product of its (nonzero) digits is 2880, while the sum is 28.
Adding to 1104620522113 its reverse (3112250264011), we get a palindrome (4216870786124).
The spelling of 1104620522113 in words is "one trillion, one hundred four billion, six hundred twenty million, five hundred twenty-two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •