Base | Representation |
---|---|
bin | 10000001010101100110… |
… | …000101101000100000011 |
3 | 10221012200111112020001222 |
4 | 100022230300231010003 |
5 | 121200312000323021 |
6 | 2210215241545255 |
7 | 143160421164332 |
oct | 20125460550403 |
9 | 3835614466058 |
10 | 1111000011011 |
11 | 3991995a7090 |
12 | 15b39b7a522b |
13 | 809c7a07927 |
14 | 3bab637bd19 |
15 | 1dd765436ab |
hex | 102acc2d103 |
1111000011011 has 8 divisors (see below), whose sum is σ = 1223327116224. Its totient is φ = 1000560756520.
The previous prime is 1111000011001. The next prime is 1111000011019. The reversal of 1111000011011 is 1101100001111.
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 1111000011011 - 214 = 1110999994627 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 1111000011011.
It is not an unprimeable number, because it can be changed into a prime (1111000011019) 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, 471961445 + ... + 471963798.
It is an arithmetic number, because the mean of its divisors is an integer number (152915889528).
Almost surely, 21111000011011 is an apocalyptic number.
1111000011011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1111000011011 is a deficient number, since it is larger than the sum of its proper divisors (112327105213).
1111000011011 is a wasteful number, since it uses less digits than its factorization.
1111000011011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 943925361.
The product of its (nonzero) digits is 1, while the sum is 8.
Adding to 1111000011011 its reverse (1101100001111), we get a palindrome (2212100012122).
The spelling of 1111000011011 in words is "one trillion, one hundred eleven billion, eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •