Base | Representation |
---|---|
bin | 1001001001010010001011… |
… | …11110111010101100010111 |
3 | 2122012111222011220110010210 |
4 | 10210221011332322230113 |
5 | 10113441203004013421 |
6 | 110434300422220503 |
7 | 4143625530045630 |
oct | 444510576725427 |
9 | 78174864813123 |
10 | 20110211001111 |
11 | 6453768924430 |
12 | 23095b0b84733 |
13 | b2b50041a36a |
14 | 4d74a7488887 |
15 | 24d1a575c576 |
hex | 124a45fbab17 |
20110211001111 has 128 divisors (see below), whose sum is σ = 34048711065600. Its totient is φ = 10255633344000.
The previous prime is 20110211001109. The next prime is 20110211001121. The reversal of 20110211001111 is 11110011201102.
It is not a de Polignac number, because 20110211001111 - 21 = 20110211001109 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20110211001121) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 1360353226 + ... + 1360368008.
It is an arithmetic number, because the mean of its divisors is an integer number (266005555200).
Almost surely, 220110211001111 is an apocalyptic number.
20110211001111 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
20110211001111 is a deficient number, since it is larger than the sum of its proper divisors (13938500064489).
20110211001111 is a wasteful number, since it uses less digits than its factorization.
20110211001111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15397.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 20110211001111 its reverse (11110011201102), we get a palindrome (31220222202213).
The spelling of 20110211001111 in words is "twenty trillion, one hundred ten billion, two hundred eleven million, one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •