Base | Representation |
---|---|
bin | 11001000010001010100111… |
… | …100001000010010110010111 |
3 | 112102211110100110011212222110 |
4 | 121002022213201002112113 |
5 | 103412334301020333421 |
6 | 1030055124232202103 |
7 | 32122314455521212 |
oct | 3102124741022627 |
9 | 472743313155873 |
10 | 110100002121111 |
11 | 3209916a994982 |
12 | 1042214bb39333 |
13 | 49585023744a2 |
14 | 1d28c23394779 |
15 | cade48c1aa76 |
hex | 6422a7842597 |
110100002121111 has 64 divisors (see below), whose sum is σ = 155047364144640. Its totient is φ = 69414339571200.
The previous prime is 110100002121107. The next prime is 110100002121139. The reversal of 110100002121111 is 111121200001011.
It is not a de Polignac number, because 110100002121111 - 22 = 110100002121107 is a prime.
It is a super-2 number, since 2×1101000021211112 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110100002121911) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 5490988036 + ... + 5491008086.
It is an arithmetic number, because the mean of its divisors is an integer number (2422615064760).
Almost surely, 2110100002121111 is an apocalyptic number.
110100002121111 is a deficient number, since it is larger than the sum of its proper divisors (44947362023529).
110100002121111 is a wasteful number, since it uses less digits than its factorization.
110100002121111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 28816.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 110100002121111 its reverse (111121200001011), we get a palindrome (221221202122122).
The spelling of 110100002121111 in words is "one hundred ten trillion, one hundred billion, two million, one hundred twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •