Base | Representation |
---|---|
bin | 10000100000001101110… |
… | …000001100011111001011 |
3 | 11000102022112012010221001 |
4 | 100200031300030133023 |
5 | 122040120114312021 |
6 | 2224555503555431 |
7 | 144636051554212 |
oct | 20401560143713 |
9 | 4012275163831 |
10 | 1134102104011 |
11 | 3a7a74087528 |
12 | 1639685bbb77 |
13 | 82c39c91146 |
14 | 3cc68644079 |
15 | 1e7797bd091 |
hex | 1080dc0c7cb |
1134102104011 has 4 divisors (see below), whose sum is σ = 1134104241024. Its totient is φ = 1134099967000.
The previous prime is 1134102103963. The next prime is 1134102104039. The reversal of 1134102104011 is 1104012014311.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1134102104011 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1134102104011.
It is not an unprimeable number, because it can be changed into a prime (1134102105011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 403461 + ... + 1559161.
It is an arithmetic number, because the mean of its divisors is an integer number (283526060256).
Almost surely, 21134102104011 is an apocalyptic number.
1134102104011 is a deficient number, since it is larger than the sum of its proper divisors (2137013).
1134102104011 is an equidigital number, since it uses as much as digits as its factorization.
1134102104011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2137012.
The product of its (nonzero) digits is 96, while the sum is 19.
Adding to 1134102104011 its reverse (1104012014311), we get a palindrome (2238114118322).
The spelling of 1134102104011 in words is "one trillion, one hundred thirty-four billion, one hundred two million, one hundred four thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •