Base | Representation |
---|---|
bin | 10000001100100100101… |
… | …000000011101000111111 |
3 | 10221101212122120120020010 |
4 | 100030210220003220333 |
5 | 121213421304310421 |
6 | 2211151000354303 |
7 | 143261310326430 |
oct | 20144450035077 |
9 | 3841778516203 |
10 | 1113011010111 |
11 | 39a030776510 |
12 | 15b861175993 |
13 | 80c58533520 |
14 | 3bc2749b487 |
15 | 1de42d7a076 |
hex | 10324a03a3f |
1113011010111 has 64 divisors (see below), whose sum is σ = 2011868651520. Its totient is φ = 528529760640.
The previous prime is 1113011010031. The next prime is 1113011010121. The reversal of 1113011010111 is 1110101103111.
It is not a de Polignac number, because 1113011010111 - 215 = 1113010977343 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1113011010121) 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 63 ways as a sum of consecutive naturals, for example, 1489881 + ... + 2108498.
It is an arithmetic number, because the mean of its divisors is an integer number (31435447680).
Almost surely, 21113011010111 is an apocalyptic number.
1113011010111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1113011010111 is a deficient number, since it is larger than the sum of its proper divisors (898857641409).
1113011010111 is a wasteful number, since it uses less digits than its factorization.
1113011010111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3598516.
The product of its (nonzero) digits is 3, while the sum is 12.
Adding to 1113011010111 its reverse (1110101103111), we get a palindrome (2223112113222).
The spelling of 1113011010111 in words is "one trillion, one hundred thirteen billion, eleven million, ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •