Base | Representation |
---|---|
bin | 11001000010001010100111… |
… | …011000111100100000001011 |
3 | 112102211110100022012010101012 |
4 | 121002022213120330200023 |
5 | 103412334300000000021 |
6 | 1030055124114514135 |
7 | 32122314431505230 |
oct | 3102124730744013 |
9 | 472743308163335 |
10 | 110100000000011 |
11 | 320991697762aa |
12 | 1042214b29594b |
13 | 4958501ab0bb8 |
14 | 1d28c22da1787 |
15 | cade4894c35b |
hex | 6422a763c80b |
110100000000011 has 8 divisors (see below), whose sum is σ = 126112608839424. Its totient is φ = 94158400513320.
The previous prime is 110099999999999. The next prime is 110100000000041. The reversal of 110100000000011 is 110000000001011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-110100000000011 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 110099999999923 and 110100000000004.
It is not an unprimeable number, because it can be changed into a prime (110100000000041) 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, 17752334855 + ... + 17752341056.
It is an arithmetic number, because the mean of its divisors is an integer number (15764076104928).
Almost surely, 2110100000000011 is an apocalyptic number.
110100000000011 is a deficient number, since it is larger than the sum of its proper divisors (16012608839413).
110100000000011 is an equidigital number, since it uses as much as digits as its factorization.
110100000000011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 35504676361.
The product of its (nonzero) digits is 1, while the sum is 5.
Adding to 110100000000011 its reverse (110000000001011), we get a palindrome (220100000001022).
The spelling of 110100000000011 in words is "one hundred ten trillion, one hundred billion, eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •