Base | Representation |
---|---|
bin | 10000001100101010100… |
… | …010001000011010100101 |
3 | 10221102010120001212120111 |
4 | 100030222202020122211 |
5 | 121214122142320401 |
6 | 2211204500533021 |
7 | 143263622624020 |
oct | 20145242103245 |
9 | 3842116055514 |
10 | 1113110120101 |
11 | 39a08170a2a1 |
12 | 15b88a3b1171 |
13 | 80c72c24ba5 |
14 | 3bc366da1b7 |
15 | 1de4b905e51 |
hex | 1032a8886a5 |
1113110120101 has 8 divisors (see below), whose sum is σ = 1289552233664. Its totient is φ = 941024602080.
The previous prime is 1113110120047. The next prime is 1113110120141. The reversal of 1113110120101 is 1010210113111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1113110120101 - 213 = 1113110111909 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1113110120141) 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, 1089148335 + ... + 1089149356.
It is an arithmetic number, because the mean of its divisors is an integer number (161194029208).
Almost surely, 21113110120101 is an apocalyptic number.
It is an amenable number.
1113110120101 is a deficient number, since it is larger than the sum of its proper divisors (176442113563).
1113110120101 is an equidigital number, since it uses as much as digits as its factorization.
1113110120101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2178297771.
The product of its (nonzero) digits is 6, while the sum is 13.
Adding to 1113110120101 its reverse (1010210113111), we get a palindrome (2123320233212).
The spelling of 1113110120101 in words is "one trillion, one hundred thirteen billion, one hundred ten million, one hundred twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •